Optimal st-orientations for plane triangulations

Journal of Combinatorial Optimization

Volumn 17, Issue 4, 2009, Pages 367-377

  Zhang, Huaming ^a   He, Xin ^b  

^a University of Alabama in Huntsville   (United States)

^b State University of New York   (United States)

Author keywords

Plane triangulation; St orientation

Indexed keywords

OPTIMIZATION; TRIANGULATION;

A-PLANE; DIRECTED PATHS; LECTURE NOTES; LINEAR TIME; PLANE GRAPHS; ST-ORIENTATION; VISIBILITY REPRESENTATION;

GRAPH THEORY;

EID: 78650809983     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-007-9119-8     Document Type: Article

References (19)

1. Chiang Y-T, Lin C-C, Lu H-I (2001) Orderly spanning trees with applications to graph encoding and graph drawing. In: Proceedings of the 12th annual ACM-SIAM SODA. ACMPress, New York, pp 506-515
2. di Battista G, Eades P, Tammassia R, Tollis I (1998) Graph drawing: algorithms for the visualization of graphs. Hall, New York
3. Ebert J (1983) st-ordering the vertices of biconnected graphs. Computing 30(1):19-33
4. Even S, Tarjan R (1976) Computing an st-numbering. Theor Comput Sci 2:339-344
5. Fraysseix HD, de Mendez PO, Rosenstiehl P (1995) Bipolar orientations revisited. Discrete Appl Math 56:157-179
6. Kant G (1997) A more compact visibility representation. Int J Comput Geom Appl 7:197-210
7. Kant G, He X (1997) Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theor Comput Sci 172:175-193
8. Lempel A, Even S, Cederbaum I (1967) An algorithm for planarity testing of graphs. In: Theory of graphs, proceedings of an international symposium, Rome, July 1966, pp 215-232
9. Lin C-C, Lu H-I, Sun I-F (2004) Improved compact visibility representation of planar graph via Schnyder's realizer. SIAM J Discrete Math 18:19-29
10. Maon Y, Schieber B, Vishkin U (1986) Parallel ear decomposition search (eds) and st-numbering in graphs. Theor Comput Sci 47:277-298
11. Ossona de Mendez P (1994) Orientations bipolaires. PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris
12. Papakostas A, Tollis IG (1998) Algorithms for area-efficient orthogonal drawings. Comput Geom Theory Appl 9:83-110
13. Papamanthou C, Tollis IG (2007) Applications of parameterized st -orientations in graph drawings. In: Proceedings of 13th international symposium on graph drawing. Lecture notes in computer science, vol 3843. Springer, Berlin, pp 355-367
14. Rosenstiehl P, Tarjan RE (1986) Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput Geom 1:343-353
15. Schnyder W (1989) Planar graphs and poset dimension. Order 5:323-343
16. Tamassia R, Tollis IG (1986) An unified approach to visibility representations of planar graphs. Discrete Comput Geom 1:321-341
17. Tarjan R (1986) Two streamlined depth-first search algorithms. Fundam Inform 9:85-94
18. Zhang H, He X (2005) New theoretical bounds of visibility representation of plane graphs. In: Proceedings of GD'2004. Lecture notes in computer science, vol 3383. Springer, Berlin, pp 425-430
19. Zhang H, He X (2006) Nearly optimal visibility representations of plane graphs. In: Proceedings of ICALP'06. Lecture notes in computer science, vol 4051. Springer, Berlin, pp 407-418