Better approximation of diagonal-flip transformation and rotation transformation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1449, Issue , 1998, Pages 85-94

  Li, Ming ^a,b   Zhang, Louxin ^a,b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; TREES (MATHEMATICS); TRIANGULATION;

APPROXIMATION RATIOS; CONVEX POLYGON TRIANGULATION; DIAGONAL FLIP; LOWER BOUNDS; ROTATION TRANSFORMATION;

APPROXIMATION ALGORITHMS;

EID: 84892606054     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68535-9_12     Document Type: Conference Paper

References (19)

1. D. Aldous, Triangulating the circle, at random. Amer Math. Monthly 89(1994), 223-234. 88.
2. B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp and L. Zhang, On distance between phylogenetic trees. Proc. of the SIAM-ACM 8th Annual Symposium on Discrete Algorithms, 427-436, 1997. 85, 86.
3. K. Culik and D. Wood, A note on some tree similarity measures, Information Processing Letters 15(1982), 39-42. 86.
4. J.-Y. Cai and M. D. Hirsch, Rotation distance, triangulation of planar surfaces and hyperbolic geometry, Proceeding of the 5th Inter. Symposium on Algorithm and Computation, Lecture Notes in Computer Science, vol. 834, 172-180, 1994. 86.
5. A. K. Dewdney, Wagner's theorem for torus graphs, Discrete Math. 4(1973), 139-149. 85.
6. L. Guibas and J. Hershberger, Morphing simple polygons, Proceeding of the ACM 10th Annual Sym. of Comput. Geometry, 267-276, 1994. 85.
7. S. Hanke, T. Ottmann and S. Schuierer, The edge-flipping distance of triangulations. Proc. of the European Workshop of Comput. Geometry, 1996. Technical Report 76, Insttut fur Informatik, Universitat Freiburg, 1996. 86.
8. J. Hershberger and S. Suri, Morphing binary trees. Proceeding of the ACM-SIAM 6th Annual Symposium of Discrete Algorithms, 396-404, 1995. 85.
9. F. Hurtado, M. Noy, and J. Urrutia, Flipping edges in triangulations, Proc. of the ACM 12th Annual Sym. of Comput. Geometry, 214-223, 1996. 86.
10. D. Knuth, The art of computer programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973. 87.
11. D. Knuth, Computer Musings (Videotape): The associative law, or the anatomy of rotations in binary trees, University Video Communications, 1993. 85, 86.
12. J. Pallo, On rotation distance in the lattice of binary trees, Infor. Proc. Letters 25(1987), 369-373. 87.
13. D. D. Sleator and R. Tarjan, Self-adjusting binary search trees, J. Assoc. Comput. Mach. 32(1985), 652-686. 85.
14. D. D. Sleator, R. Tarjan and W. Thurston, Rotation distance, in T. M. Cover and B. Gopinath eds, Open problems in communication and computation, Springer-Verlag, 1987. 86.
15. D. D. Sleator, R. Tarjan and W. Thurston, Rotation distance, triangulations, and hyperbolic geometry, Proc. of the 18th Annual ACM Symposium on Theory of Comput., Berkeley, CA., 122-135, 1986. Also appearing on J. of American Math. Soc. 1(1988), No. 3, 647-681. 85, 86, 87, 89.
16. D. D. Sleator, R. Tarjan and W. Thurston, Short encoding of evolving structures, SIAM J. Disc. Math. 5(1992), 428-450. 86.
17. D. Swofford, G. J. Olsen, P. J. Waddell and D. M. Hillis, Phylogenetic Inference, In Molecular Systematics, 2nd Edition, edited by D. M. Hillis, C. Moritz and B. K. Mable, Sinauer Associates, Mass., 1996. 85.
18. R. E. Tarjan, Data structures and network algorithms, Soc. Indus. Appl. Math., Philadelphia, PA. 1983. 85.
19. K. Wagner, Bemerkungen zum vierfarbenproblem, J. Deutschen Math.-Verin. 46(1936), 26-32. 85.