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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Papamanthou, C., & Tollis, I. G. (2006). Applications of parameterized st-orientations in graph drawing algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3843 LNCS, pp. 355–367). https://doi.org/10.1007/11618058_32
Mendeley helps you to discover research relevant for your work.