Algorithms for computing a parameterized st-orientation

Theoretical Computer Science

Volumn 408, Issue 2-3, 2008, Pages 224-240

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

^a Brown Univerity   (United States)

^b INSTITUTE OF COMPUTER SCIENCE   (Greece)

^c UNIVERSITY OF CRETE   (Greece)

Author keywords

Graph algorithms; Longest path; Planar graphs; s t numberings

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; DRAWING (GRAPHICS); NETWORK PROTOCOLS; SENSOR NETWORKS;

APPLICATIONS.; AS-GRAPH; BIPOLAR; COMPUTING; EFFICIENT; GRAPH ALGORITHMS; GRAPH DRAWINGS; LONGEST PATH; LONGEST PATHS; NEW ALGORITHMS; ORIENTED GRAPHS; PARAMETERIZED; PLANAR GRAPHS; S T-NUMBERINGS; TO MANY; UNDIRECTED GRAPHS;

GRAPH THEORY;

EID: 55049108523     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.08.012     Document Type: Article

References (25)

1. C. Papamanthou, I.G. Tollis, Parameterized s t-orientations of graphs: algorithms and experiments, in: Proc. International Conference on Graph Drawing, 2006, pp. 220-233
2. Tamassia R., and Tollis I.G. A unified approach to visibility representations of planar graphs. Discrete and Computational Geometry 1 (1986) 321-341
3. Papakostas A., and Tollis I.G. Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications 9 (1998) 83-110
4. Di Battista G., Eades P., Tamassia R., and Tollis I.G. Annotated bibliography on graph drawing algorithms. Computational Geometry: Theory and Applications 4 (1994) 235-282
5. Di Battista G., Eades P., Tamassia R., and Tollis I.G. Graph Drawing: Algorithms for the Visualization of Graphs (1999), Prentice Hall
6. Sugiyama K., Tagawa S., and Toda M. Methods for visual understanding of hierarchical systems. Transactions on Systems, Man, and Cybernetics SMC-11 2 (1981) 109-125
7. Annexstein F., and Berman K. Directional routing via generalized s t-numberings. Discrete Mathematics 13 2 (2000) 268-279
8. Mursalin Akon M., Asaduzzaman S., Saidur Rahman Md., and Matsumoto M. Proposal for s t-routing. Telecommunication Systems 25 3-4 (2004) 287-298
9. Nakano S., Saidur Rahman Md., and Nishizeki T. A linear-time algorithm for four-partitioning four-connected planar graphs. Information Processing Letters 62 (1997) 315-322
10. Even S., and Tarjan R. Computing an s t-numbering. Theoretical Computer Science 2 (1976) 339-344
11. C. Papamanthou, I.G. Tollis, Applications of parameterized s t-orientations in graph drawing algorithms, in: Proc. International Conference on Graph Drawing, 2005, pp. 355-367
12. A. Lempel, S. Even, I. Cederbaum, An algorithm for planarity testing of graphs, in: Theory of Graphs: International Symposium, 1967, pp. 215-232
13. Ebert J. s t-ordering the vertices of biconnected graphs. Computing 30 1 (1983) 19-33
14. Tarjan R. Two streamlined depth-first search algorithms. Fundamenta Informaticae 9 (1986) 85-94
15. Rosenstiehl P., and Tarjan R. Rectilinear planar layout and bipolar orientation of planar graphs. Discrete Computational Geometry 1 (1986) 343-353
16. Maon Y., Schieber B., and Vishkin U. Parallel ear decomposition search (eds) and s t-numbering in graphs. Theoretical Computer Science 47 (1986) 277-298
17. Brandes U. Eager s t-ordering. Proc. European Symposium on Algorithms (2002) 247-256
18. De Fraysseix H., Ossona de Mendez P., and Rosenstiehl P. Bipolar orientations revisited. Discrete Applied Mathematics 56 (1995) 157-179
19. C. Papamanthou, I.G. Tollis, s t-numberings and longest paths, manuscript, ICS-FORTH, 2004
20. Hopcroft J., and Tarjan R. Efficient algorithms for graph manipulation. Communications of ACM 16 (1973) 372-378
21. Holm J., de Lichtenberg K., and Thorup M. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. Journal of the ACM 48 4 (2001) 723-760
22. T. Lukovszki, W. Strothmann, Decremental biconnectivity on planar graphs, Technical report, University of Paderborn, tr-ri-97-186, 1997
23. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-completeness (1979), W.H. Freeman and Company
24. T. Gallai, On directed paths and circuits, in: Theory of Graphs: International Symposium, 1968, pp. 215-232
25. Goodrich M.T., and Tamassia R. Data Structures and Algorithms in Java. fourth ed. (2005), John Wiley & Sons