Max-Coloring Paths: Tight Bounds and Extensions
From MaRDI portal
Publication:3652194
DOI10.1007/978-3-642-10631-6_11zbMath1272.68336OpenAlexW1817404108MaRDI QIDQ3652194
Telikepalli Kavitha, Julián Mestre
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: http://link.springer.com/10.1007/s10878-010-9290-1
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Improved approximation algorithms for the max edge-coloring problem ⋮ Clique Clustering Yields a PTAS for max-Coloring Interval Graphs ⋮ On the max coloring problem
This page was built for publication: Max-Coloring Paths: Tight Bounds and Extensions