Lex-BFS a partition refining technique, application to transitive orientation and consecutive 1's testing

Abstract : By making use of lexicographic breadth first search, Lex-BFS and partition refinement with pivots, we obtain very simple algorithms for some well-known problems in graph theory. We give an O(n + m log n) algorithm for transitive orientation of a comparability graph, and simple linear algorithms to recognize interval graphs, convex graphs, Y-semichordal graphs and matrices that have the consecutive-ones property. Previous approaches to these problems used difficult preprocessing steps such as computing PQ trees or modular decomposition. The algorithms we give are easy to understand and straightforward to prove. They do not make use of sophisticated data structures and the complexity analysis is straightforward.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00471613
Contributor : Laurent Viennot <>
Submitted on : Thursday, April 8, 2010 - 4:13:39 PM
Last modification on : Friday, April 12, 2019 - 10:18:03 AM
Long-term archiving on : Friday, July 9, 2010 - 8:32:36 PM

Files

tcs99.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00471613, version 1

Citation

Michel Habib, Ross Mac Connell, Christophe Paul, Laurent Viennot. Lex-BFS a partition refining technique, application to transitive orientation and consecutive 1's testing. Theoretical Computer Science, Elsevier, 2000, 234. ⟨inria-00471613⟩

Share

Metrics

Record views

315

Files downloads

324