|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/11474
|
| タイトル: | Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs |
| 著者: | Kiyomi, Masashi
Saitoh, Toshiki
Uehara, Ryuhei |
| キーワード: | the graph reconstruction conjecture
permutation graphs
polynomial time algorithm |
| 発行日: | 2013-03-01 |
| 出版者: | 電子情報通信学会 |
| 誌名: | IEICE TRANSACTIONS on Information and Systems |
| 巻: | E96-D |
| 号: | 3 |
| 開始ページ: | 426 |
| 終了ページ: | 432 |
| 抄録: | PREIMAGE CONSTRUCTION problem by Kratsch and Hemaspaandra naturally arose from the famous graph reconstruction conjecture. It deals with the algorithmic aspects of the conjecture. We present an O(n^8) time algorithm for PREIMAGE CONSTRUCTION on permutation graphs and an O(n^4(n+m)) time algorithm for PREIMAGE CONSTRUCTION on distance-hereditary graphs, where n is the number of graphs in the input, and m is the number of edges in a preimage. Since each graph of the input has n-1 vertices and O(n^2) edges, the input size is O(n^3) (, or O(nm)). There are polynomial time isomorphism algorithms for permutation graphs and distance-hereditary graphs. However the number of permutation (distance-hereditary) graphs obtained by adding a vertex to a permutation (distance-hereditary) graph is generally exponentially large. Thus exhaustive checking of these graphs does not achieve any polynomial time algorithm. Therefore reducing the number of preimage candidates is the key point. |
| Rights: | Copyright (C)2013 IEICE. Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara, IEICE TRANSACTIONS on Information and Systems, E96-D(3), 2013, 426-432. http://www.ieice.org/jpn/trans_online/ |
| URI: | http://hdl.handle.net/10119/11474 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 19111.pdf | | 540Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
