Approximating interval coloring and max-coloring in chordal graphs
From MaRDI portal
Publication:3507752
DOI10.1145/1064546.1180619zbMath1143.05306MaRDI 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
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Dual parameterization of Weighted Coloring, Linear-Time Generation of Random Chordal Graphs, Ruling out FPT algorithms for weighted coloring on forests, On the max coloring problem, Dual parameterization of weighted coloring, About equivalent interval colorings of weighted graphs, On spectrum assignment in elastic optical tree-networks, The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation