|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/12333
|
| タイトル: | The graph isomorphism problem on geometric graphs |
| 著者: | Uehara, Ryuhei |
| キーワード: | graph isomorphism
intersection graph
graph recognition
unit grid intersection graph |
| 発行日: | 2014 |
| 出版者: | Discrete Mathematics and Theoretical Computer Science |
| 誌名: | Discrete Mathematics and Theoretical Computer Science |
| 巻: | 16 |
| 号: | 2 |
| 開始ページ: | 87 |
| 終了ページ: | 96 |
| 抄録: | The graph isomorphism (GI) problem asks whether two given graphs are isomorphic or not. The GI problem is quite basic and simple, however, it's time complexity is a long standing open problem. The GI problem is clearly in NP, no polynomial time algorithm is known, and the GI problem is not NP-complete unless the polynomial hierarchy collapses. In this paper, we survey the computational complexity of the problem on some graph classes that have geometric characterizations. Sometimes the GI problem becomes polynomial time solvable when we add some restrictions on some graph classes. The properties of these graph classes on the boundary indicate us the essence of difficulty of the GI problem. We also show that the GI problem is as hard as the problem on general graphs even for grid unit intersection graphs on a torus, that partially solves an open problem. |
| Rights: | Copyright (C) 2014 Discrete Mathematics and Theoretical Computer Science. Ryuhei Uehara, Discrete Mathematics and Theoretical Computer Science, 16(2), 2014, 87-96. |
| URI: | http://hdl.handle.net/10119/12333 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 21147.pdf | | 214Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
