Parameterized st-Orientations of Graphs: Algorithms and Experiments

  • Charalampos Papamanthou
  • Ioannis G. Tollis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4372)


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.


Planar Graph Undirected Graph Weighted Graph Longe Path Hamiltonian Path 
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.


  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Disc. and Comp. Geom. 1, 321–341 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications 9, 83–110 (1998)zbMATHMathSciNetGoogle Scholar
  4. 4.
    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)zbMATHMathSciNetGoogle Scholar
  5. 5.
    Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)zbMATHGoogle Scholar
  6. 6.
    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)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Annexstein, F., Berman, K.: Directional routing via generalized st-numberings. SIAM J. Discrete Math. 13(2), 268–279 (2000)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Akon, M.M., Asaduzzaman, S., Rahman, M.S., Matsumoto, M.: Proposal for st-routing. Tellecommunication Systems 25(3-4), 287–298 (2004)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefMathSciNetGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Even, S., Tarjan, R.: Computing an st-numbering. Theoretical Computer Science 2, 339–344 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Ebert, J.: st-ordering the vertices of biconenected graphs. Computing 30(1), 19–33 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Tarjan, R.: Two streamlined depth-first search algorithms. Fundamentae Informatica 9, 85–94 (1986)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Rosenstiehl, P., Tarjan, R.: Rectilinear planar layout and bipolar orientation of planar graphs. Discrete Comput. Geom. 1, 343–353 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Maon, Y., Schieber, B., Vishkin, U.: Parallel ear decomposition search (eds) and st-numbering in graphs. Theoret. Comput. Sci. 47, 277–298 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Brandes, U.: Eager st-ordering. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 247–256. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  17. 17.
    Fraysseix, H.D., de Mendez, P.O., Rosenstiehl, P.: Bipolar orientations revisited. Discrete Applied Mathematics 56, 157–179 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Papamanthou, C., Tollis, I.G.: st-numberings and longest paths. Manuscript, ICS-FORTH (2004)Google Scholar
  19. 19.
    Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. Comm. ACM 16, 372–378 (1973)CrossRefGoogle Scholar
  20. 20.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Lukovszki, T., Strothmann, W.-B.: Decremental biconnectivity on planar graphs technical report, university of paderborn, tr-ri-97-186Google Scholar
  22. 22.
    Gallai, T.: On directed paths and circuits. In: Erdos, P. (ed.) Theory of Graphs: International Symposium, July 1966, pp. 215–232 (1967)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Charalampos Papamanthou
    • 1
  • Ioannis G. Tollis
    • 2
  1. 1.Department of Computer Science, Brown University, P.O. Box 1910, Providence RIU.S.A.
  2. 2.Department of Computer Science, University of Crete, P.O. Box 2208 &, Institute of Computer Science, FORTH, P.O. Box 1385, HeraklionGreece

Personalised recommendations