Approximating interval coloring and max-coloring in chordal graphs
From MaRDI portal
Publication:3507752
DOI10.1145/1064546.1180619zbMath1143.05306OpenAlexW2158133904MaRDI QIDQ3507752
Sriram Penumatcha, Rajiv Raman, Sriram V. Pemmaraju
Publication date: 20 June 2008
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1064546.1180619
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (8)
Linear-Time Generation of Random Chordal Graphs ⋮ On spectrum assignment in elastic optical tree-networks ⋮ Dual parameterization of Weighted Coloring ⋮ On the max coloring problem ⋮ About equivalent interval colorings of weighted graphs ⋮ The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation ⋮ Ruling out FPT algorithms for weighted coloring on forests ⋮ Dual parameterization of weighted coloring
This page was built for publication: Approximating interval coloring and max-coloring in chordal graphs