Algorithms for computing a parameterized st-orientation

Authors:
Charalampos Papamanthou;Ioannis G. Tollis
Affiliations:
Department of Computer Science, Brown University, Providence RI, USA;Institute of Computer Science (ICS), Foundation for Research and Technology - Hellas (FORTH), Heraklion, Greece and Department of Computer Science, University of Crete, Heraklion, Greece
Venue:
Theoretical Computer Science
Year:
2008

Citing 15
Cited 5

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

Theoretical Computer Science
Visibility representations of planar graphs (abstract)

ACM SIGACT News
Algorithms for drawing graphs: an annotated bibliography

Computational Geometry: Theory and Applications
Bipolar orientations revisited

Discrete Applied Mathematics - Special issue: Fifth Franco-Japanese Days, Kyoto, October 1992
A linear-time algorithm for four-partitioning four-connected planar graphs

Information Processing Letters
Algorithms for area-efficient orthogonal drawings

Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Directional Routing via Generalized st-Numberings

SIAM Journal on Discrete Mathematics
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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Eager st-Ordering

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Data Structures and Algorithms in Java

Data Structures and Algorithms in Java
Parameterized st-orientations of graphs: algorithms and experiments

GD'06 Proceedings of the 14th international conference on Graph drawing
Applications of parameterized st-orientations in graph drawing algorithms

GD'05 Proceedings of the 13th international conference on Graph Drawing

NP-Completeness of st-orientations for plane graphs

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

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Overloaded orthogonal drawings

GD'11 Proceedings of the 19th international conference on Graph Drawing
Compact visibility representation of 4-connected plane graphs

Theoretical Computer Science
DAGView: an approach for visualizing large graphs

GD'12 Proceedings of the 20th international conference on Graph Drawing

Quantified Score

Hi-index	5.23

Visualization

Abstract

st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the past to compute an st-orientation of a biconnected graph. In this paper, we present new algorithms that compute such orientations with certain (parameterized) characteristics in the final st-oriented graph, such as the length of the longest path. This work has many applications, including Graph Drawing and Network Routing, where the length of the longest path is vital in deciding certain features of the final solution. This work applies to other difficult problems as well, such as graph coloring and of course longest path. We present extended theoretical and experimental results which show that our technique is efficient and performs well in practice.