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/7873

Title: Linear structure of bipartite permutation graphs and the longest path problem
Authors: Uehara, Ryuhei
Valiente, Gabriel
Keywords: Bipartite permutation graphs
Graph decomposition
Linear time algorithms
Issue Date: 2007-07-16
Publisher: Elsevier
Magazine name: Information Processing Letters
Volume: 103
Number: 2
Start page: 71
End page: 77
DOI: 10.1016/j.ipl.2007.02.010
Abstract: 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
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
C9978.pdf184KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, JAIST (ir-sys[at]ml.jaist.ac.jp)