International Symposium on Graph Drawing

GD 2005: Graph Drawing pp 355-367

Applications of Parameterized st-Orientations in Graph Drawing Algorithms

  • Charalampos Papamanthou
  • Ioannis G. Tollis
Conference paper

DOI: 10.1007/11618058_32

Volume 3843 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Papamanthou C., Tollis I.G. (2006) Applications of Parameterized st-Orientations in Graph Drawing Algorithms. In: Healy P., Nikolov N.S. (eds) Graph Drawing. GD 2005. Lecture Notes in Computer Science, vol 3843. Springer, Berlin, Heidelberg

Abstract

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Charalampos Papamanthou
    • 1
    • 2
  • Ioannis G. Tollis
    • 1
    • 2
  1. 1.Department of Computer ScienceUniversity of CreteHeraklionGreece
  2. 2.Institute of Computer ScienceFORTH, Vasilika VoutonHeraklionGreece