Some aspects of perfect elimination orderings in chordal graphs
- 31 March 1984
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 7 (3) , 325-331
- https://doi.org/10.1016/0166-218x(84)90008-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Algorithmic Aspects of Perfect GraphsPublished by Elsevier ,1984
- Polynomially bounded algorithms for locatingp-centers on a treeMathematical Programming, 1982
- Scheduling Interval-Ordered TasksSIAM Journal on Computing, 1979
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962