|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/7891
|
| Title: | On Computing Longest Paths in Small Graph Classes |
| Authors: | Uehara, Ryuhei
Uno, Yushi |
| Keywords: | algorithmic graph theory
design and analysis of algorithms
graph classes
longest path problem |
| Issue Date: | 2007-10 |
| Publisher: | World Scientific Publishing |
| Magazine name: | International Journal of Foundations of Computer Science |
| Volume: | 18 |
| Number: | 5 |
| Start page: | 911 |
| End page: | 930 |
| DOI: | 10.1142/S0129054107005054 |
| Abstract: | 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 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| C11139.pdf | | 188Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
