Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

Journal of Algorithms

Volumn 34, Issue 2, 2000, Pages 337-369

  Chan, Wun Tat ^a   Chin, Francis Y L ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037520828     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1054     Document Type: Article

References (24)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, "Network Flow: Theory, Algorithms and Applications," Prentice Hall, Englewood Cliffs, NJ, 1993.
2. Y. Birk and J. B. Lotspiech, On finding non-intersecting straightline connections of grid points to the boundary, J. Algorithms 13 (1992), 636-656.
3. J. A. Bondy and U. S. R. Murty, "Graph Theory with Applications," North-Holland, Amsterdam, 1977.
4. J. Bruck and V. P. Roychowdhury, How to play bowling in parallel on the grid, J. Algorithms 12 (1991), 516-529.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1991.
6. L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Canad. J. Math. 8 (1956), 399-404.
7. A. Frank, Packing paths, circuits, and cuts - A survey, in "Paths, Flows, and VLSI-Layout" (B. Korte, L. Lovász, H. J. Prömel, and A. Schrijiver, Eds.), pp. 47-100, Springer-Verlag, Berlin, 1990.
8. M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian, Faster shortest-path algorithms for planar graphs, J. Comput. System Sci. 55 (1997), 3-23.
9. J. Hershberger and S. Suri, Efficient breakout routing in printed circuit boards, in "Algorithms and Data Structures, 5th International Workshop," Lecture Notes in Computer Science, Vol. 1272, pp. 462-471, Springer-Verlag, Berlin, 1997.
10. M. Kaufmann and K. Mehlhorn, Routing problems in grid graphs, in "Paths, Flows, and VLSI-Layout" (B. Korte, L. Lovász, H. J. Prömel, and A. Schrijiver, Eds.), pp. 165-184, Springer-Verlag, Berlin, 1990.
11. S. Khuller and J. Naor, Flow in planar graphs: A survey of recent results, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. (1993), 59-84.
12. S. Khuller and J. Naor, Flow in planar graphs with vertex capacities, Algorithmica 11 (1994), 200-225.
13. G. L. Miller and J. S. Naor, Flow in planar graphs with multiple sources and sinks, SIAM J. Comput. 24 (1995), 1002-1017.
14. L. Palios, Connecting the maximum number of nodes in the grid to the boundary with nonintersecting line segments, J. Algorithms 22 (1997), 57-92.
15. C. H. Papadimitrious and K. Steiglitz, "Combinatorial Optimization: Algorithm and Complexity," Prentice Hall, Englewood Cliffs, NJ, 1982.
16. H. Ripphausen-Lipa, D. Wagner, and K. Weihe, Efficient algorithms for disjoint paths in planar graphs, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. (1995), 295-354.
17. H. Ripphausen-Lipa, D. Wagner, and K. Weihe, The vertex-disjoint Menger problem in planar graphs, SIAM J. Comput. 26 (1997), 331-349.
18. N. Robertson and P. D. Seymour, An outline of a disjoint paths algorithm, in "Paths, Flows, and VLSI-Layout" (B. Korte, L. Lovász, H. J. Prömel, and A. Schrijiver, Eds.), pp. 267-292, Springer-Verlag, Berlin, 1990.
19. V. P. Roychowdhury and J. Bruck, On finding non-intersecting paths in grids and its application in reconfiguring VLSI/WSI arrays, in "Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990," pp. 454-464.
20. V. P. Roychowdhury, J. Bruck, and T. Kailath, Efficient algorithms for reconfiguration in VLSI/WSI arrays, IEEE Trans. Comput. 39 (1990), 480-489.
21. T. A. Varvarigou, V. P. Roychowdhury, and T. Kailath, Reconfigurating processor arrays using multiple-track models: The 3-track-1-spare-approach, IEEE Trans. Comput. 42 (1993), 1281-1292.
22. D. Wagner and K. Weihe, A linear-time algorithm for edge-disjoint paths in planar graphs, Combinatorica 15 (1995), 135-150.
23. K. Weihe, Edge-disjoint (s, t)-paths in undirected planar graphs in linear time, J. Algorithms 23 (1997), 121-138.
24. M.-F. Yu and W. W.-M. Dai, Single-layer fanout routing and routability analysis for ball grid arrays, in "Proceedings of IEEE/ACM International Conference on Computer- Aided Design, 1995," pp. 581-586.