Indexed metadata
The Linearity of First-Fit Coloring of Interval Graphs
H. A. Kierstead
Source abstract
It is shown that First-Fit coloring requires at most colors to color an interval graph with clique size . It follows that a polynomial time approximation algorithm for Dynamic Storage Allocation due to Chrobak and Slusarek has a constant performance ratio of 80.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.