Applications of Parameterized st-Orientations in Graph Drawing Algorithms
Many graph drawing algorithms use st-numberings (st-orien-tations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a directed graph with no cycles, one single source s and one single sink t. As there exist exponentially many st-numberings that correspond to a certain undirected graph G, using different st-numberings in various graph drawing algorithms can result in aesthetically different drawings with different area bounds. In this paper, we present results concerning new algorithms for parameterized st-orientations, their impact on graph drawing algorithms and especially in visibility representations.
- 5.Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Rosestiehl, P. (ed.) Theory of Graphs: International Symposium, July 1966, pp. 215–232 (1967)Google Scholar
- 11.Papamanthou, C., Tollis, I.G.: Algorithms for parameterized st-orientations of graphs. Submitted to ESA 2005 (2005)Google Scholar
- 14.Goodrich, M.T., Tamassia, R.: Data Structures and Algorithms in Java, 2nd edn. John Wiley & Sons, Chichester (2001)Google Scholar