Parameterized st-orientations of graphs: Algorithms and experiments

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

Volumn 4372 LNCS, Issue , 2007, Pages 220-233

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

^a Brown Univerity   (United States)

^b UNIVERSITY OF CRETE   (Greece)

^c INSTITUTE OF COMPUTER SCIENCE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; NETWORK ROUTING; PARAMETER ESTIMATION; PROBLEM SOLVING;

BICONNECTED GRAPH; GRAPH DRAWING; TIME ALGORITHM;

GRAPH THEORY;

EID: 38149093471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70904-6_22     Document Type: Conference Paper

References (22)

1. C. Papamanthou and I.G. Tollis. Applications of parameterized si-orientations in graph drawing algorithms. In LNCS Graph Drawing 2004, volume 3843, pages 355-367, 2005.
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. G.D. Battista, P. Eades, R. Tamassia, and I.G. Tollis. Annotated bibliography on graph drawing algorithms. Computational Geometry: Theory and Applications, 4:235-282, 1994.
5. G.D. Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
6. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. on Systems, Man, and Cybernetics, SMC-11(2):109-125, 1981.
7. F. Annexstein and K. Berman. Directional routing via generalized st-numberings. SIAM J. Discrete Math., 13(2):268-279, 2000.
8. M. Mursalin Akon, S. Asaduzzaman, M.S. Rahman, and M. Matsumoto. Proposal for st-routing. Telecommunication Systems, 25(3-4):287-298, 2004.
9. S. Nakano, M.S. Rahman, and T. Nishizeki. A linear-time algorithm for fourpartitioning four-connected planar graphs. Information Processing Letters, 62:315-322, 1997.
10. A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In P. Rosenstiehl(ed.) Theory of Graphs: Tihany, Academic Press, New York, pages 115-118, 1968.
11. S. Even and R. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:339-344, 1976.
12. J. Ebert. st-ordering the vertices of biconenected graphs. Computing, 30(1):19-33, 1983.
13. R. Tarjan. Two streamlined depth-first search algorithms. Fundamentae Informatica, 9:85-94, 1986.
14. P. Rosenstiehl and R. Tarjan. Rectilinear planar layout and bipolar orientation of planar graphs. Discrete Comput. Geom., 1:343-353, 1986.
15. Y. Maon, B. Schieber, and U. Vishkin. Parallel ear decomposition search (eds) and st-numbering in graphs. Theoret. Comput Sci, 47:277-298, 1986.
16. Ulrik Brandes. Eager st-ordering. In LNCS ESA 2002, volume 2461, pages 247-256, 2002.
17. H.D. Fraysseix, P.O. de Mendez, and P. Rosenstiehl. Bipolar orientations revisited. Discrete Applied Mathematics, 56:157-179, 1995.
18. C. Papamanthou and I.G. Tollis. st-numberings and longest paths, manuscript, ICS-FORTH 2004.
19. J. Hopcroft and R. Tarjan. Efficient algorithms for graph manipulation. Comm. ACM, 16:372-378, 1973.
20. J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. J. ACM, 48(4):723-760, 2001.
21. Tarns Lukovszki and Willy-B. Strothmann. Decremental biconnectivity on planar graphs technical report, university of paderborn, tr-ri-97-186.
22. T. Gallai. On directed paths and circuits. In P. Erdos(ed.) Theory of Graphs: International Symposium July 1966, pages 215-232, 1967.