### Abstract

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.

Original language | English |
---|---|

Title of host publication | Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings |

Pages | 417-426 |

Number of pages | 10 |

Publication status | Published - 1998 Dec 1 |

Event | 9th Annual International Symposium on Algorithms and Computation, ISAAC'98 - Taejon, Korea, Republic of Duration: 1998 Dec 14 → 1998 Dec 16 |

### Publication series

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

Volume | 1533 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

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

Country | Korea, Republic of |

City | Taejon |

Period | 98/12/14 → 98/12/16 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'The edge-disjoint paths problem is np-complete for partial k-trees'. Together they form a unique fingerprint.

## Cite this

*Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings*(pp. 417-426). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1533 LNCS).