NP-Completeness of s t-orientations for plane graphs

Theoretical Computer Science

Volumn 411, Issue 7-9, 2010, Pages 995-1003

  Sadasivam, Sadish ^a   Zhang, Huaming ^a  

^a University of Alabama in Huntsville   (United States)

Author keywords

NP Complete; Plane graph; s t orientation

Indexed keywords

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

COMPUTATIONAL COMPLEXITY;

POLYNOMIALS;

EID: 74849094626     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.11.006     Document Type: Article

References (17)

1. Annexstein F., and Berman K. Directional routing via generalized st-numberings. Discrete Mathematics 13 (2000) 268-279
2. Battista G.D., Eades P., Tamassia R., and Tollis I.G. Graph Drawing: Algorithms for the Visualization of Graphs (1999), Prentice Hall
3. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), Elsevier Science
4. Even S., and Tarjan R.E. Computing an st-Numbering. Theoretical Computer Science 2 (1976) 339-344
5. T. Gallai, On directed paths and circuits, in: Theory of Graphs: International Symposium, 1968, pp. 215-232
6. Garey M.R., and Johnson D.S. Computers and Intractability; A Guide to the Theory of NP-Completeness (1990), W. H. Freeman & Co
7. He X. On finding the rectangular duals of planar triangular graphs. SIAM Journal on Computing 22 (1993) 1218-1226
8. He X., and Kao M. Regular edge labelings and drawings of planar graphs. Lecture Notes in Computer Science 894 (1995) 96-103
9. Lempel A., Even S., and Cederbaum I. An algorithm for planarity testing of graphs. Theory of Graphs (Proc. of an International Symposium, Rome, July 1966) (1967) 215-232
10. P.O. Mendez, Orientations bipolaires, Ph.D. Thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris, 1994
11. Mursalin A., Asaduzzaman S., Saidur R., and Matsumoto M. Proposal for st-routing. Telecommunication Systems 25 (2004) 287-298
12. Nakano S., Saidur M.R., and Nishizeki T. A linear-time algorithm for four-partitioning four-connected planar graphs. Information Processing Letters 62 (1997) 315-322
13. Papakostas A., and Tollis I.G. Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications 9 (1998) 83-110
14. Papamanthou C., and Tollis I.G. Applications of parameterized st-orientations in graph drawing algorithms. Lecture Notes in Computer Science 3843 (2006) 355-367
15. Papamanthou C., and Tollis I.G. Algorithms for computing a parameterized st-orientation. Theoretical Computer Science 408 (2008) 224-240
16. Rosenstiehl P., and Tarjan R.E. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete & Computational Geometry 1 (1986) 343-353
17. Tamassia R., and Tollis I.G. A unified approach to visibility representations of planar graphs. Discrete Computational Geometry 1 (1986) 321-341