|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/7833
|
| タイトル: | Longest Path Problems on Ptolemaic Graphs |
| 著者: | TAKAHARA, Yoshihiro
TERAMOTO, Sachio
UEHARA, Ryuhei |
| キーワード: | dynamic programming
Hamiltonian path/cycle problem
longest path/cycle problem
Ptolemaic graphs |
| 発行日: | 2008-02-01 |
| 出版者: | 電子情報通信学会 |
| 誌名: | IEICE TRANSACTIONS on Information and Systems |
| 巻: | E91-D |
| 号: | 2 |
| 開始ページ: | 170 |
| 終了ページ: | 177 |
| DOI: | 10.1093/ietisy/e91-d.2.170 |
| 抄録: | Longest path problem is a problem for finding a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, there are few known graph classes such that the longest path problem can be solved efficiently. Polynomial time algorithms for finding a longest cycle and a longest path in a Ptolemaic graph are proposed. Ptolemaic graphs are the graphs that satisfy the Ptolemy inequality, and they are the intersection of chordal graphs and distance-hereditary graphs. The algorithms use the dynamic programming technique on a laminar structure of cliques, which is a recent characterization of Ptolemaic graphs. |
| Rights: | Copyright (C)2008 IEICE. Yoshihiro Takahara, Sachio Teramoto, and Ryuhei Uehara, IEICE TRANSACTIONS on Information and Systems, E91-D(2), 2008, 170-177. http://www.ieice.org/jpn/trans_online/ |
| URI: | http://hdl.handle.net/10119/7833 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| A11151.pdf | | 253Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
