Subgraph isomorphism in graph classes

Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno

研究成果: ジャーナルへの寄稿学術誌査読

13 被引用数 (Scopus)

抄録

We investigate the computational complexity of the following restricted variant of Subgraph Isomorphism: given a pair of connected graphs G=(V G,E G) and H=(V H,E H), determine if H is isomorphic to a spanning subgraph of G. The problem is NP-complete in general, and thus we consider cases where G and H belong to the same graph class such as the class of proper interval graphs, of trivially perfect graphs, and of bipartite permutation graphs. For these graph classes, several restricted versions of Subgraph Isomorphism such as Hamiltonian Path, Clique, Bandwidth, and Graph Isomorphism can be solved in polynomial time, while these problems are hard in general.

本文言語英語
ページ(範囲)3164-3173
ページ数10
ジャーナルDiscrete Mathematics
312
21
DOI
出版ステータス出版済み - 11月 6 2012

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • 離散数学と組合せ数学

フィンガープリント

「Subgraph isomorphism in graph classes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル