An optimal greedy heuristic to color interval graphs
Author:
- Stephan OlariuSOStephan Olariu
- 1 January 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 37 (1) , 21-25
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Four classes of perfectly orderable graphsJournal of Graph Theory, 1987
- Computer-assisted sequencing, interval graphs, and molecular evolutionBioSystems, 1982
- One-dimensional logic gate assignment and interval graphsIEEE Transactions on Circuits and Systems, 1979
- A Linear Time Algorithm for Deciding Interval Graph IsomorphismJournal of the ACM, 1979
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- 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
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961