|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/7891
|
| タイトル: | On Computing Longest Paths in Small Graph Classes |
| 著者: | Uehara, Ryuhei
Uno, Yushi |
| キーワード: | algorithmic graph theory
design and analysis of algorithms
graph classes
longest path problem |
| 発行日: | 2007-10 |
| 出版者: | World Scientific Publishing |
| 誌名: | International Journal of Foundations of Computer Science |
| 巻: | 18 |
| 号: | 5 |
| 開始ページ: | 911 |
| 終了ページ: | 930 |
| DOI: | 10.1142/S0129054107005054 |
| 抄録: | The longest path problem is the one that finds a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, few graph classes are known to be solved efficiently for the longest path problem. Among those, for trees, a simple linear time algorithm for the longest path problem is known. We first generalize the algorithm, and show that the longest path problem can be solved efficiently for some tree-like graph classes by this approach. We next propose two new graph classes that have natural interval representations, and show that the longest path problem can be solved efficiently on these classes. |
| Rights: | Electronic version of an article published as International Journal of Foundations of Computer Science, 18(5), 2007, 911-930. DOI:10.1142/S0129054107005054. Copyright World Scientific Publishing Company, http://dx.doi.org/10.1142/S0129054107005054 |
| URI: | http://hdl.handle.net/10119/7891 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| C11139.pdf | | 188Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
