Abstract
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the past to compute an st-orientation of a biconnected graph. However, as indicated in [1], the computation of more than one st-orientation is very important for many applications in multiple research areas, such as this of Graph Drawing. In this paper we show how to compute such orientations with certain (parameterized) characteristics in the final st-oriented graph, such as the length of the longest path. Apart from Graph Drawing, this work applies in other areas such as Network Routing and in tackling difficult problems such as Graph Coloring and Longest Path. We present primary approaches to the problem of computing longest path parameterized st-orientations of graphs, an analytical presentation (together with proof of correctness) of a new O(mlog5n) (O(mlogn) for planar graphs) time algorithm that computes such orientations (and which was used in [1]) and extensive computational results that reveal the robustness of the algorithm.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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)
Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Disc. and Comp. Geom. 1, 321–341 (1986)
Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications 9, 83–110 (1998)
Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Annotated bibliography on graph drawing algorithms. Computational Geometry: Theory and Applications 4, 235–282 (1994)
Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical systems. IEEE Trans. on Systems, Man, and Cybernetics (SMC) 11(2), 109–125 (1981)
Annexstein, F., Berman, K.: Directional routing via generalized st-numberings. SIAM J. Discrete Math. 13(2), 268–279 (2000)
Akon, M.M., Asaduzzaman, S., Rahman, M.S., Matsumoto, M.: Proposal for st-routing. Tellecommunication Systems 25(3-4), 287–298 (2004)
Nakano, S., Rahman, M.S., Nishizeki, T.: A linear-time algorithm for four-partitioning four-connected planar graphs. Information Processing Letters 62, 315–322 (1997)
Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Rosenstieh, P. (ed.) Theory of Graphs, Tihany, pp. 115–118. Academic Press, New York (1968)
Even, S., Tarjan, R.: Computing an st-numbering. Theoretical Computer Science 2, 339–344 (1976)
Ebert, J.: st-ordering the vertices of biconenected graphs. Computing 30(1), 19–33 (1983)
Tarjan, R.: Two streamlined depth-first search algorithms. Fundamentae Informatica 9, 85–94 (1986)
Rosenstiehl, P., Tarjan, R.: Rectilinear planar layout and bipolar orientation of planar graphs. Discrete Comput. Geom. 1, 343–353 (1986)
Maon, Y., Schieber, B., Vishkin, U.: Parallel ear decomposition search (eds) and st-numbering in graphs. Theoret. Comput. Sci. 47, 277–298 (1986)
Brandes, U.: Eager st-ordering. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 247–256. Springer, Heidelberg (2002)
Fraysseix, H.D., de Mendez, P.O., Rosenstiehl, P.: Bipolar orientations revisited. Discrete Applied Mathematics 56, 157–179 (1995)
Papamanthou, C., Tollis, I.G.: st-numberings and longest paths. Manuscript, ICS-FORTH (2004)
Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. Comm. ACM 16, 372–378 (1973)
Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. J. ACM 48(4), 723–760 (2001)
Lukovszki, T., Strothmann, W.-B.: Decremental biconnectivity on planar graphs technical report, university of paderborn, tr-ri-97-186
Gallai, T.: On directed paths and circuits. In: Erdos, P. (ed.) Theory of Graphs: International Symposium, July 1966, pp. 215–232 (1967)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Papamanthou, C., Tollis, I.G. (2007). Parameterized st-Orientations of Graphs: Algorithms and Experiments. In: Kaufmann, M., Wagner, D. (eds) Graph Drawing. GD 2006. Lecture Notes in Computer Science, vol 4372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70904-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-70904-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70903-9
Online ISBN: 978-3-540-70904-6
eBook Packages: Computer ScienceComputer Science (R0)