Lex-BFS a partition refining technique, application to transitive orientation and consecutive 1's testing - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2000

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

(1) , (2) , (3) , (4)
1
2
3
4

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.
Fichier principal
Vignette du fichier
tcs99.pdf (303.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00471613 , version 1 (08-04-2010)

Identifiers

  • HAL Id : inria-00471613 , version 1

Cite

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, 2000, 234. ⟨inria-00471613⟩
281 View
332 Download

Share

Gmail Facebook Twitter LinkedIn More