Abstract
An st-orientation or bipolar orientation of a 2-connected graph G is an orientation of its edges to generate a directed acyclic graph with a single source s and a single sink t. Given a plane graph G and two vertices s and t on the exterior face of G, the problem of finding an optimum st-orientation, i.e., an st-orientation in which the length of the longest st-path is minimized, was first proposed indirectly by Rosenstiehl and Tarjan in [14] and then later directly by He and Kao in [6]. In this paper, we prove that, given a 2-connected plane graph G, two vertices s, t, on the exterior face of G and a positive integer K, the decision problem of whether G has an st-orientation, where the maximum length of an st-path is ≤ K, is NP-Complete. This solves a long standing open problem on the complexity of optimum st-orientations for plane graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Annexstein, F., Berman, K.: Directional routing via generalized st-numberings. Discrete Mathematics 13, 268–279 (2000)
Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)
Even, S., Tarjan, R.E.: Computing an st-Numbering. Theoretical Computer Science 2, 339–344 (1976)
Gallai, T.: On directed paths and circuits. In: Theory of Graphs: International Symposium, pp. 215–232 (1968)
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
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)
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)
Mendez, P.O.: Orientations bipolaires, PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris (1994)
Mursalin, A., Asaduzzaman, S., Saidur, R., Matsumoto, M.: Proposal for st-routing. Telecommunication Systems 25, 287–298 (2004)
Nakano, S., Saidur, M.R., Nishizeki, T.: A linear-time algorithm for four-partitioning four-connected planar graphs. Information Processing Letters 62, 315–322 (1997)
Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications 9, 83–110 (1998)
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)
Papamanthou, C., Tollis, I.G.: Algorithms for computing a parameterized st-orientation. Theoretical Computer Science 408, 224–240 (2008)
Rosenstiehl, P., Tarjan, R.E.: Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs. Discrete & Computational Geometry 1, 343–353 (1986)
Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discrete and Computational Geometry 1, 321–341 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sadasivam, S., Zhang, H. (2009). NP-Completeness of st-Orientations for Plane Graphs. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds) Fundamentals of Computation Theory. FCT 2009. Lecture Notes in Computer Science, vol 5699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03409-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-03409-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03408-4
Online ISBN: 978-3-642-03409-1
eBook Packages: Computer ScienceComputer Science (R0)