|
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/7833
|
| Title: | Longest Path Problems on Ptolemaic Graphs |
| Authors: | TAKAHARA, Yoshihiro
TERAMOTO, Sachio
UEHARA, Ryuhei |
| Keywords: | dynamic programming
Hamiltonian path/cycle problem
longest path/cycle problem
Ptolemaic graphs |
| Issue Date: | 2008-02-01 |
| Publisher: | 電子情報通信学会 |
| Magazine name: | IEICE TRANSACTIONS on Information and Systems |
| Volume: | E91-D |
| Number: | 2 |
| Start page: | 170 |
| End page: | 177 |
| DOI: | 10.1093/ietisy/e91-d.2.170 |
| Abstract: | 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 |
| Material Type: | publisher |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| A11151.pdf | | 253Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
