Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs (1999)
| Venue: | SIAM Journal on Computing |
| Citations: | 11 - 2 self |
BibTeX
@ARTICLE{Hsu99fastand,
author = {Wen-lian Hsu and Tze-heng Ma},
title = {Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs},
journal = {SIAM Journal on Computing},
year = {1999},
volume = {28},
pages = {1004--1020}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. In this paper, we present a linear-time algorithm for substitution decomposition on chordal graphs. Based on this result, we develop a linear-time algorithm for transitive orientation on chordal comparability graphs, which reduces the complexity of chordal comparability recognition from O(n 2)toO(n+m). We also devise a simple linear-time algorithm for interval graph recognition where no complicated data structure is involved. Key words. chordal graph, triangulated graph, interval graph, analysis of algorithms, graph theory, substitution decomposition, modular decomposition, cycle-free poset, transitive orientation, graph partitioning, cardinality lexicographic ordering, graph recognition
