Applications of parameterized st-orientations in graph drawing algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3843 LNCS, Issue , 2006, Pages 355-367

  Papamanthou, Charalampos ^a,b   Tollis, Ioannis G ^a,b  

^a UNIVERSITY OF CRETE   (Greece)

^b INSTITUTE OF COMPUTER SCIENCE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER AIDED ANALYSIS; COMPUTER GRAPHICS; PARAMETER ESTIMATION; VISIBILITY;

AESTHETICALLY DIFFERENT DRAWINGS; GRAPH DRAWING ALGORITHMS; PARAMETERIZED ST-ORIENTATIONS; UNDIRECTED GRAPHS;

DRAWING (GRAPHICS);

EID: 33745664551     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_32     Document Type: Conference Paper

References (14)

1. G.D. Battista, P. Eades, R. Tamassia, and I.G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, 1999.
2. R. Tamassia and I.G. Tollis. A unified approach to visibility representations of planar graphs. Disc. and Comp. Geom., 1:321-341, 1986.
3. A. Papakostas and I.G. Tollis, Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications, 9:83-110, 1998.
4. S. Even and R. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:339-344, 1976.
5. A. Lempel, S. Even, and I. Cederbaum, An algorithm for planarity testing of graphs. In P. Rosestiehl(ed.) Theory of Graphs: International Symposium July 1966, pages 215-232, 1967.
6. J. Ebert. st-ordering the vertices of biconenected graphs. Computing, 30(1):19-33, 1983.
7. R. Tarjan. Two streamlined depth-first search algorithms. Pundamentae Informatica, 9:85-94, 1986.
8. P. Rosehnstiehl and R. Tarjan. Rectilinear planar layout and bipolar orientation of planar graphs. Discrete Comput. Geom., 1:343-353, 1986.
9. Y. Maon, B. Schieber, and U. Vishkin. Parallel ear decomposition search (eds) and st-numbering in graphs. Theoret. Comput. Sci, 47:277-298, 1986.
10. H.D. Fraysseix, P.O. de Mendez, and P. Rosenstiehl. Bipolar orientations revisited. Discrete Applied Mathematics, 56:157-179, 1995.
11. C. Papamanthou and I.G. Tollis. Algorithms for parameterized st-orientations of graphs, submitted to ESA2005.
12. J. Hopcroft and R. Tarjan. Efficient algorithms for graph manipulation. Comm. ACM, 16:372-378, 1973.
13. J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. J. ACM, 48(4):723-760, 2001.
14. Michael T. Goodrich and Roberto Tamassia. Data Structures and Algorithms in Java. John Wiley & Sons, 2 edition, 2001.