2016年9月1日
Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees
Foundations of Computing and Decision Sciences
- 巻
- 41
- 号
- 3
- 開始ページ
- 163
- 終了ページ
- 181
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1515/fcds-2016-0010
- 出版者・発行元
- Walter de Gruyter GmbH
In this paper, we deal with two variants of graph matching, the graph isomorphism with restriction and the prefix set of graph isomorphism. The former problem is known to be NP-complete, whereas the latter problem is known to be GI-complete. We propose polynomial time exact algorithms for these problems on partial k-trees.
- ID情報
-
- DOI : 10.1515/fcds-2016-0010
- ISSN : 0867-6356
- SCOPUS ID : 84989897663