|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/7873
|
| タイトル: | Linear structure of bipartite permutation graphs and the longest path problem |
| 著者: | Uehara, Ryuhei
Valiente, Gabriel |
| キーワード: | Bipartite permutation graphs
Graph decomposition
Linear time algorithms |
| 発行日: | 2007-07-16 |
| 出版者: | Elsevier |
| 誌名: | Information Processing Letters |
| 巻: | 103 |
| 号: | 2 |
| 開始ページ: | 71 |
| 終了ページ: | 77 |
| DOI: | 10.1016/j.ipl.2007.02.010 |
| 抄録: | The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bipartite permutation graph is proposed in this note. The decomposition gives a linear structure of bipartite permutation graphs, and it can be obtained in O(n) time, where n is the number of vertices. As an application of the decomposition, we show an O(n) time and space algorithm for finding a longest path in a bipartite permutation graph. |
| Rights: | NOTICE: This is the author’s version of a work accepted for publication by Elsevier. Changes resulting from the publishing process, including peer review, editing, corrections, structural formatting and other quality control mechanisms, may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Ryuhei Uehara, Gabriel Valiente, Information Processing Letters, 103(2), 2007, 71-77, http://dx.doi.org/10.1016/j.ipl.2007.02.010 |
| URI: | http://hdl.handle.net/10119/7873 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| C9978.pdf | | 184Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
