Output-sensitive reporting of disjoint paths

Algorithmica (New York)

Volumn 23, Issue 4, 1999, Pages 302-340

  Di Battista, G ^a   Tamassia, R ^b   Vismara, L ^b  

^a ROMA TRE UNIVERSITY   (Italy)

^b Brown Univerity   (United States)

Author keywords

Biconnected graph; Coloring; Connectivity; Disjoint paths; Graph drawing; Triconnected graph

Indexed keywords

EID: 0013362396     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009264     Document Type: Article

References (56)

1. T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. Comput. Geom. Theory Appl., 9:159-180, 1998.
2. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. North-Holland, Amsterdam, 1976.
3. G. R. Brightwell and W. T. Trotter. The order dimension of convex polytopes. SIAM J. Discrete Math., 6(2):230-245, 1993.
4. G. R. Brightwell and W. T. Trotter. The order dimension of planar maps. SIAM J. Discrete Math., 10(4):515-528, 1997.
5. J. Cheriyan and S. N. Maheshwari. Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms, 9:507-537, 1988.
6. N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa. A linear algorithm for embedding planar graphs using PQ-trees. J. Comput. System Sco., 30(1):54-76, 1985.
7. M. Chrobak, M. T. Goodrich, and R. Tamassia. Convex drawings of graphs in two and three dimensions. In Proc. 12th Ann. ACM Symp. Comput. Geom., pages 319-328, 1996.
8. M. Chrobak and G. Kant. Convex grid drawings of 3-connected planar graphs. Internat. J. Comput. Geom. Appl., 7(3):211-223, 1997.
9. M. Chrobak and S. Nakano. Minimum-width grid drawings of plane graphs. Comput. Geom. Theory Appl., 11(1):29-54, 1998.
10. R. F. Cohen, G. Di Battista, A. Kanevsky, and R. Tamassia. Reinventing the wheel: An optimal data structure for connectivity queries. In Proc. 25th Ann. ACM Symp. Theory Comput., pages 194-200, 1993.
11. H. de Fraysseix, P. O. de Mendez, and P. Rosenstiehl. Bipolar orientations revisited. Discrete Appl. Math., 56:157-179, 1995.
12. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41-51, 1990.
13. H. de Fraysseix and P. Rosenstiehl. Structures combinatoires pour des traces automatiques de reseaux. In Proc. 3rd European Conf. on CAD/CAM and Computer Graphics, pages 332-337, 1984.
14. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4(5):235-282, 1994.
15. G. Di Battista and R. Tamassia. On-line maintenance of triconnected components with SPQR-trees. Algorithmica, 15(3):302-318, 1996.
16. G. Di Battista and R. Tamassia. On-line planarity testing. SIAM J. Comput., 25(5):956-997, 1996.
17. J. Edmonds. Edge-disjoint branchings. In R. Rustin, editor, Combinatorial Algorithms, pages 91-96. Algorithmics Press, New York, 1972.
18. S. Even and R. E. Tarjan. Network flow and testing graph connectivity. SIAM J. Comput., 4:507-518, 1975.
19. S. Even and R. E. Tarjan. Computing an st-numbering. Theoret. Comput. Sci., 2:339-344, 1976.
20. I. Fary. On straight lines representation of planar graphs. Acta Sci. Math. Szeged., 11:229-233, 1948.
21. F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1969.
22. X. He and M.-Y. Kao. Regular edge labelings and drawings of planar graphs. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 96-103. Springer-Verlag, Berlin, 1995.
23. J. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM J. Comput., 2(3):135-158, 1973.
24. A. Huck. Independent trees in graphs. Graphs Combin., 10(1):29-45, 1994.
25. A. Huck. Disproof of a conjecture about independent branchings in k-connected directed graphs. J. Graph Theory, 20(2):235-239, 1995.
26. A. Huck. Independent trees and branchings in planar multigraphs. Graphs Combin., to appear.
27. A. Itai and M. Rodeh. The multi-tree approach to reliability in distributed networks. Inform. and Comput., 79(1):43-59, 1988.
28. T. Kameda. On the vector representation of the reachability in planar directed graphs. Inform. Process. Lett., 3(3):75-77, 1975.
29. A. Kanevsky, R. Tamassia, G. Di Battista, and J. Chen. On-line maintenance of the four-connected components of a graph. In Proc. 32nd Ann. IEEE Symp. Found. Comput. Sci., pages 793-801, 1991.
30. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16(1):4-32, 1996. Special Issue on Graph Drawing, G. Di Battista and R. Tamassia, editors.
31. G. Kant and X. He. Two algorithms for finding rectangular duals of planar graphs. In J. van Leeuwen, editor, Graph-Theoretic Concepts in Computer Science (Proc. WG '93), volume 790 of Lecture Notes in Computer Science, pages 396-410. Springer-Verlag, Berlin, 1993.
32. M.-Y. Kao, M. Fürer, X. He, and B. Raghavachari. Optimal parallel algorithms for straight-line grid embeddings of planar graphs. SIAM J. Discrete Math., 7(4):632-646, 1994.
33. D. Kelly and I. Rival. Planar lattices. Canad. J. Math., 27(3):636-665, 1975.
34. S. Khuller and B. Schieber. On independent spanning trees. Inform. Process. Lett., 42(6):321-323, 1992.
35. A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In Theory of Graphs: International Symposium, pages 215-232. Gordon and Breach, New York, 1967.
36. H. Nagamochi and T. Ibaraki. A linear-time algorithm for finding a sparse k -connected spanning subgraph of a k-connected graph. Algorithmica, 7:583-596, 1992.
37. F. P. Preparata and R. Tamassia. Fully dynamic point location in a monotone subdivision. SIAM J. Comput., 18:811-830, 1989.
38. H. Ripphausen-Lipa, D. Wagner, and K. Weihe. The vertex-disjoint Menger problem in planar graphs. SIAM J. Comput., 26(2):331-349, 1997.
39. P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom., 1(4):343-353, 1986.
40. W. Schnyder. Planar graphs and poset dimension. Order, 5:323-343, 1989.
41. W. Schnyder. Embedding planar graphs on the grid. In Proc. 1st Ann. ACM-SIAM Symp. Discrete Algorithms, pages 138-148, 1990.
42. W. Schnyder and W. T. Trotter. Convex embeddings of 3-connected plane graphs. Abstracts Amer. Math. Soc., 13(5):502, 1992.
43. S. K. Stein. Convex maps. Proc. Amer. Math. Soc., 2(3):464-466, 1951.
44. E. Steinitz and H. Rademacher. Vorlesungen über die Theorie der Polyeder. Julius Springer, Berlin, 1934.
45. R. Tamassia. On-line planar graph embedding. J. Algorithms, 21(2):201-239, 1996.
46. R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom., 1(4):321-341, 1986.
47. R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans. Circuits and Systems, CAS-36(9):1230-1234, 1989.
48. R. Tamassia and J. S. Vitter. Parallel transitive closure and point location in planar structures. SIAM J. Comput., 20(4):708-725, 1991.
49. P. Tong and E. L. Lawler. A faster algorithm for finding edge-disjoint branchings. Inform. Process. Lett., 17(2):73-76, 1983.
50. W. T. Tutte. Convex representations of graphs. Proc. London Math. Soc., 10(38):304-320, 1960.
51. W. T. Tutte. How to draw a graph. Proc. London Math. Soc., 13(52):743-768, 1963.
52. K. Wagner. Bemerkungen zum vierfarbenproblem. Jahresber. Deutsch. Math.-Verein., 46:26-32, 1936.
53. J. Westbrook and R. E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7(5/6):433-464, 1992.
54. R. W. Whitty. Vertex-disjoint paths and edge-disjoint branchings in directed graphs. J. Graph Theory, 11(3):349-358, 1987.
55. S. K. Wismath. Characterizing bar line-of-sight graphs. In Proc. 1st Ann. ACM Symp. Comput. Geom., pages 147-152, 1985.
56. A. Zehavi and A. Itai. Three tree-paths. J. Graph Theory, 13(2): 175-188, 1989.