Finding edge-disjoint paths in partial k-trees

X. Zhou, S. Tamura, T. Nishizeki

研究成果: Article査読

16 被引用数 (Scopus)

抄録

For a given graph G and p pairs (si, ti), 1 ≤ i ≤ p, of vertices in G, the edge-disjoint paths problem is to find p pairwise edge-disjoint paths Pi, 1 ≤ i ≤ p, connecting si and ti. Many combinatorial problems can be efficiently solved for partial k-trees (graphs of treewidth bounded by a fixed integer k), but the edge-disjoint paths problem is NP-complete even for partial 3-trees. This paper gives two algorithms for the edge-disjoint paths problem on partial k-trees. The first one solves the problem for any partial k-tree G and runs in polynomial time if p = O(log n) and in linear time if p = O(1), where n is the number of vertices in G. The second one solves the problem under some restriction on the location of terminal pairs even if p ≥ log n.

本文言語English
ページ(範囲)3-30
ページ数28
ジャーナルAlgorithmica (New York)
26
1
DOI
出版ステータスPublished - 2000

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)
  • コンピュータ サイエンスの応用
  • 応用数学

フィンガープリント

「Finding edge-disjoint paths in partial k-trees」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル