|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4896
|
| タイトル: | Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs |
| 著者: | Uehara, Ryuhei
Toda, Seinosuke
Nagoya, Takayuki |
| キーワード: | Graph isomorphism problem
Graph isomorphism complete
Strongly chordal graphs
Chordal bipertite graphs |
| 発行日: | 2005-01-30 |
| 出版者: | Elsevier |
| 誌名: | Discrete Applied Mathematics |
| 巻: | 145 |
| 号: | 3 |
| 開始ページ: | 479 |
| 終了ページ: | 482 |
| DOI: | 10.1016/j.dam.2004.06.008 |
| 抄録: | This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and k-trees for unbounded k. On the other side, the relative complexity of the GI problem for the above classes was unknown. We prove that deciding isomorphism of the classes are GI complete. |
| Rights: | NOTICE: This is the author’s version of a work accepted for publication by Elsevier.
Changes resulting from the publishing process, including peer review, editing, corrections,
structural formatting and other quality control mechanisms, may not be reflected in this
document. Changes may have been made to this work since it was submitted for publication.
A definitive version was subsequently published in Ryuhei Uehara, Seinosuke Toda and Takayuki Nagoya, Discrete Applied Mathematics, 145(3), 2005, 479-482, http://dx.doi.org/10.1016/j.dam.2004.06.008 |
| URI: | http://hdl.handle.net/10119/4896 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| C3941.pdf | | 82Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
