A simple test for the consecutive ones property

Journal of Algorithms

Volumn 43, Issue 1, 2002, Pages 1-16

  Hsu, Wen Lian ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PATTERN MATCHING; SET THEORY; TREES (MATHEMATICS);

CONSECUTIVE ONES PROPERTY; LINEAR-TIME-AMORTIZED ANALYSIS;

MATRIX ALGEBRA;

EID: 0036557484     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1205     Document Type: Article

References (5)

1. K. S. Booth and G. S. Lueker, Testing of the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci. 13, No. 3 (1976), 335-379.
2. D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific J. Math. 15 (1965), 835-855.
3. M. C. Golumbic, "Algorithmic Graph Theory and Perfect Graphs," Academic Press, New York, 1980.
4. N. Korte and R. H. Möhring, An incremental linear-time algorithm for recognizing interval graphs, SIAM J. Comput. 18 (1989), 68-81.
5. A. Lempel, S. Even, and I. Cederbaum, An algorithm for planarity testing of graphs, in "Theory of Graphs" (P. Rosenstiehl, Ed.), pp. 215-232, Gordon and Breach, New York, 1967.