|
JAIST Repository >
f. 情報社会基盤研究センター >
f10. 学術雑誌論文等 >
f10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/3277
|
| タイトル: | Laminar structure of ptolemaic graphs and its applications |
| 著者: | Uehara, R
Uno, Y |
| キーワード: | algorithmic graph theory
data structure
Hamiltonian cycle
intersection model
ptolemaic graphs |
| 発行日: | 2005 |
| 出版者: | SPRINGER-VERLAG |
| 誌名: | Lecture Notes in Computer Science : including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics |
| 巻: | 3827 |
| 開始ページ: | 186 |
| 終了ページ: | 195 |
| DOI: | 10.1007/11602613_20 |
| 抄録: | Ptolemaic graphs are graphs that satisfy the Ptolemaic inequality for any four vertices. The graph class coincides with the intersection of chordal graphs and distance hereditary graphs, and it is a natural generalization of block graphs (and hence trees). In this paper, a new characterization of ptolemaic graphs is presented. It is a laminar structure of cliques, and leads us to a canonical tree representation, which gives a simple intersection model for ptolemaic graphs. The tree representation is constructed in linear time from a perfect elimination ordering obtained by the lexicographic breadth first search. Hence the recognition and the graph isomorphism for ptolemaic graphs can be solved in linear time. Using the tree representation, we also give an O(n) time algorithm for the Hamiltonian cycle problem. |
| Rights: | This is the author-created version of Springer Berlin / Heidelberg, Ryuhei Uehara and Yushi Uno, Lecture Notes in Computer Science(Algorithms and Computation), 3827, 2005, 186-195. The original publication is available at www.springerlink.com, http://www.springerlink.com/content/pk7x44w4t8331085 |
| URI: | http://hdl.handle.net/10119/3277 |
| 資料タイプ: | author |
| 出現コレクション: | f10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| S-50.pdf | | 157Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
