TY - GEN

T1 - The edge-disjoint paths problem is np-complete for partial k-trees

AU - Zhou, Xiao

AU - Nishizeki, Takao

PY - 1998

Y1 - 1998

N2 - Many combinatorial problems are NP-complete for general graphs, but are not NP-complete for partial k-trees (graphs of treewidth bounded by a constant k) and can be efficiently solved in polynomial time or mostly in linear time for partial k-trees. On the other hand, very few problems are known to be NP-complete for partial k-trees with bounded k. These include the subgraph isomorphism problem and the bandwidth problem. However, all these problems are NP-complete even for ordinary trees or forests. In this paper we show that the edge-disjoint paths problem is NP-complete for partial k-trees with some bounded k, say k = 3, although the problem is trivially solvable for trees.

AB - Many combinatorial problems are NP-complete for general graphs, but are not NP-complete for partial k-trees (graphs of treewidth bounded by a constant k) and can be efficiently solved in polynomial time or mostly in linear time for partial k-trees. On the other hand, very few problems are known to be NP-complete for partial k-trees with bounded k. These include the subgraph isomorphism problem and the bandwidth problem. However, all these problems are NP-complete even for ordinary trees or forests. In this paper we show that the edge-disjoint paths problem is NP-complete for partial k-trees with some bounded k, say k = 3, although the problem is trivially solvable for trees.

UR - http://www.scopus.com/inward/record.url?scp=84867453493&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867453493&partnerID=8YFLogxK

U2 - 10.1007/3-540-49381-6_44

DO - 10.1007/3-540-49381-6_44

M3 - Conference contribution

AN - SCOPUS:84867453493

SN - 3540653856

SN - 9783540653851

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 417

EP - 426

BT - Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings

PB - Springer Verlag

T2 - 9th Annual International Symposium on Algorithms and Computation, ISAAC'98

Y2 - 14 December 1998 through 16 December 1998

ER -