NP-completeness of st-orientations for plane graphs

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

Volumn 5699 LNCS, Issue , 2009, Pages 298-309

  Sadasivam, Sadish ^a   Zhang, Huaming ^a  

^a University of Alabama in Huntsville   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

2-CONNECTED GRAPHS; A-PLANE; DECISION PROBLEMS; DIRECTED ACYCLIC GRAPHS; NP COMPLETE; NP-COMPLETENESS; OPEN PROBLEMS; PLANE GRAPHS; POSITIVE INTEGERS; SINGLE SOURCE;

COMPUTATIONAL COMPLEXITY; HELIUM;

GRAPH THEORY;

EID: 70350634077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03409-1_27     Document Type: Conference Paper

References (15)

1. Annexstein, F., Berman, K.: Directional routing via generalized st-numberings. Discrete Mathematics 13, 268-279 (2000)
2. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)
3. Even, S., Tarjan, R.E.: Computing an st-Numbering. Theoretical Computer Science 2, 339-344 (1976)
4. Gallai, T.: On directed paths and circuits. In: Theory of Graphs: International Symposium, pp. 215-232 (1968)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
6. He, X., Kao, M.: Regular edge labelings and drawings of planar graphs. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 96-103. Springer, Heidelberg (1995)
7. Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs. Proc. of an International Symposium, Rome, July 1966, pp. 215-232 (1967)
8. Mendez, P.O.: Orientations bipolaires, PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris (1994)
9. Mursalin, A., Asaduzzaman, S., Saidur, R., Matsumoto, M.: Proposal for strouting. Telecommunication Systems 25, 287-298 (2004)
10. Nakano, S., Saidur, M.R., Nishizeki, T.: A linear-time algorithm for fourpartitioning four-connected planar graphs. Information Processing Letters 62, 315-322 (1997)
11. Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications 9, 83-110 (1998)
12. Papamanthou, C., Tollis, I.G.: Applications of Parameterized st-Orientations in Graph Drawing Algorithms. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 355-367. Springer, Heidelberg (2006)
13. Papamanthou, C., Tollis, I.G.: Algorithms for computing a parameterized storientation. Theoretical Computer Science 408, 224-240 (2008)
14. Rosenstiehl, P., Tarjan, R.E.: Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs. Discrete & Computational Geometry 1, 343-353 (1986)
15. Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discrete and Computational Geometry 1, 321-341 (1986)