Bounded Max-colorings of Graphs

DOI10.1007/978-3-642-17517-6_32zbMath1310.68099OpenAlexW1627572202MaRDI QIDQ3060747

Ioannis Milis, Alexander V. Kononov, Giorgio Lucarelli, Evripidis Bampis

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17517-6_32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items

Clique Clustering Yields a PTAS for max-Coloring Interval Graphs ⋮ Clique partitioning with value-monotone submodular cost