The edge-disjoint paths problem is NP-complete for series-parallel graphs

Takao Nishizeki, Jens Vygen, Xiao Zhou

研究成果: Article査読

51 被引用数 (Scopus)

抄録

Many combinatorial problems are NP-complete for general graphs. However, when restricted to series-parallel graphs or partial k-trees, many of these problems can be solved in polynomial time, mostly in linear time. On the other hand, very few problems are known to be NP-complete for series-parallel graphs or partial k-trees. These include the subgraph isomorphism problem and the bandwidth problem. However, these problems are NP-complete even for trees. In this paper, we show that the edge-disjoint paths problem is NP-complete for series-parallel graphs and for partial 2-trees although the problem is trivial for trees and can be solved for outerplanar graphs in polynomial time.

本文言語English
ページ(範囲)177-186
ページ数10
ジャーナルDiscrete Applied Mathematics
115
1-3
DOI
出版ステータスPublished - 2001 11 15

ASJC Scopus subject areas

  • 離散数学と組合せ数学
  • 応用数学

フィンガープリント

「The edge-disjoint paths problem is NP-complete for series-parallel graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル