An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- 1 February 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (1) , 68-81
- https://doi.org/10.1137/0218005
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Exact and Approximate Solutions for the Gate Matrix Layout ProblemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Interval graphs and related topicsDiscrete Mathematics, 1985
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Algorithmic Aspects of Comparability Graphs and Interval GraphsPublished by Springer Nature ,1985
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1984
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965