Applications of Parameterized st-Orientations in Graph Drawing Algorithms

Abstract. Many graph drawing algorithms use st-numberings (st-orientations 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.

• Type: Conference
• Year: 2005
• Where: GD
• Authors: Charalampos Papamanthou, Ioannis G. Tollis
• Keywords: Certain Undirected Graph, GD 2005, Graph Drawing Algorithms, Undirected Graph