Eulerian disjoint paths problem in grid graphs is NP-complete

Authors:
Dániel Marx
Affiliations:
Department of Computer Science and Information Theory, Budapest University of Technology and Economics, H-1521 Budapest, Hungary
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 1
Cited 8

NP-completeness of some edge-disjoint paths problems

Discrete Applied Mathematics

Precoloring extension on unit interval graphs

Discrete Applied Mathematics
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs

Journal of Discrete Algorithms
Placement-and-routing-based register allocation for coarse-grained reconfigurable arrays

Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
Disjoint paths in sparse graphs

Discrete Applied Mathematics
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Precoloring extension on unit interval graphs

Discrete Applied Mathematics
Using antimodels to define agents' strategy

CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
A nature-inspired algorithm for the disjoint paths problem

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.04

Visualization

Abstract

We show that the edge disjoint paths problem is NP-complete in directed or undirected rectangular grids, even if the union G + H of the supply and the demand graphs is Eulerian.