Applications of parameterized st-orientations in graph drawing algorithms

Authors:
Charalampos Papamanthou;Ioannis G. Tollis
Affiliations:
Department of Computer Science, University of Crete, Heraklion, Greece;Department of Computer Science, University of Crete, Heraklion, Greece
Venue:
GD'05 Proceedings of the 13th international conference on Graph Drawing
Year:
2005

Citing 6
Cited 8

Parallel ear decomposition search (EDS) and st-numbering in graphs

Theoretical Computer Science
Bipolar orientations revisited

Discrete Applied Mathematics - Special issue: Fifth Franco-Japanese Days, Kyoto, October 1992
Algorithms for area-efficient orthogonal drawings

Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Algorithm 447: efficient algorithms for graph manipulation

Communications of the ACM
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Journal of the ACM (JACM)
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs

Optimal st-Orientations for Plane Triangulations

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
On Representation of Planar Graphs by Segments

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Algorithms for computing a parameterized st-orientation

Theoretical Computer Science
NP-Completeness of st-orientations for plane graphs

Theoretical Computer Science
Parameterized st-orientations of graphs: algorithms and experiments

GD'06 Proceedings of the 14th international conference on Graph drawing
NP-completeness of st-orientations for plane graphs

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Compact visibility representation of 4-connected plane graphs

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Compact visibility representation of 4-connected plane graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.