Eulerian disjoint paths problem in grid graphs is NP -complete

Discrete Applied Mathematics

Volumn 143, Issue 1-3, 2004, Pages 336-341

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Disjoint paths; Grids; NP completeness

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; ROUTERS; SET THEORY; THEOREM PROVING; VLSI CIRCUITS;

DISJOINT PATHS; PLANAR GRAPHS; UNDIRECTED RECTANGULAR GRIDS;

GRAPH THEORY;

EID: 4243140423     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.12.003     Document Type: Article

References (7)

1. Frank A. Disjoint paths in a rectilinear grid. Combinatorica. 2(4):1982;361-371.
2. A. Frank, Packing paths, circuits, and cuts - a survey, in: B. Korte, L. Lovq́sz, H.J. Prömel, A. Schrijver (Eds.), Paths, Flows, and VLSI-layout (Bonn, 1988), Springer, Berlin, 1990, pp. 47-100.
3. Garey M.R., Johnson D.S., Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1(3):1976;237-267.
4. Moore C., Robson J.M. Hard tiling problems with simple tiles. Discrete Comput. Geom. 26(4):2001;573-590.
5. Okamura H., Seymour P.D. Multicommodity flows in planar graphs. J. Combin. Theory Ser. B. 31(1):1981;75-81.
6. J. Vygen, Disjoint paths, Technical Report 94816, Research Institute for Discrete Mathematics, University of Bonn, 1994.
7. Vygen J. NP-completeness of some edge-disjoint paths problems. Discrete Appl. Math. 61(1):1995;83-90.