Nearly optimal visibility representations of plane graphs

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

Volumn 4051 LNCS, Issue , 2006, Pages 407-418

  He, Xin ^a   Zhang, Huaming ^b  

^a State University of New York   (United States)

^b University of Alabama in Huntsville   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; GRAPH THEORY; OPTIMIZATION; VISIBILITY;

PLANE GRAPH G; PLANE GRAPHS; VERTICES; VISIBILITY REPRESENTATION (VR);

PROBLEM SOLVING;

EID: 33746351502     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_36     Document Type: Conference Paper

References (11)

1. N. Bonichon, C. Gavoille, and N. Hanusse, An information-theoretic upper bound of planar graphs using triangulation, in Proc. STACS'03, pp 499-510, Lectures Notes in Computer Science, Vol. 2607, Springer-Verlag, 2003.
2. Y.-T. Chiang, C.-C. Lin and H.-I. Lu, Orderly spanning trees with applications to graph encoding and graph drawing, in Proc. of the 12th Annual ACM-SIAM SODA, pp. 506-515, ACM Press, New York, 2001.
3. G. Di Battista, R. Tamassia and L. Vismara, Output-sensitive Reporting of Disjoint Paths. Algorithmica 23, no.4 (1999), 302-340.
4. A. Lempel, S. Even and I. Cederbaum, An algorithm for planarity testing of graphs, in Theory of Graphs (Proc. of an International Symposium, Rome,July 1966), pp. 215-232, Rome, 1967.
5. P. Ossona de Mendez, Orientations bipolaires. PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris, 1994.
6. P. Rosenstiehl and R. E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1 (1986), 343-353.
7. W. Schnyder, Planar graphs and poset dimension. Order 5 (1989), 323-343.
8. R. Tamassia and I.G.Tollis, An unified approach to visibility representations of planar graphs. Discrete Comput. Geom. 1 (1986), 321-341.
9. H. Zhang and X. He, Visibility Representation of Plane Graphs via Canonical Ordering Tree, Information Processing Letters 96 (2005), 41-48.
10. H. Zhang and X. He, Improved Visibility Representation of Plane Graphs, Computational Geometry: Theory and Applications 30 (2005), 29-29.
11. H. Zhang and X. He, An Application of Well-Orderly Trees in Graph Drawing, in: Proc. GD'2005, Lectures Notes in Computer Science, Vol. 3843, 458-467, Springer-Verlag, 2006.