On minimal augmentation of a graph to obtain an interval graph
- 1 February 1981
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 22 (1) , 60-97
- https://doi.org/10.1016/0022-0000(81)90022-2
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- One-dimensional logic gate assignment and interval graphsIEEE Transactions on Circuits and Systems, 1979
- 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
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrixJournal of Mathematical Analysis and Applications, 1976
- A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a GraphSIAM Journal on Computing, 1976
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962