An improved algorithm for approximating the chromatic number of \(G_{n,p}\)

DOI10.1016/j.ipl.2006.05.004zbMath1184.05041OpenAlexW2007944679MaRDI QIDQ845732

Lars Kuhtz, Amin Coja-Oghlan

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.004

zbMATH Keywords

graph algorithmsapproximation algorithms

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

\([r,s,t\)-coloring of trees and bipartite graphs]

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the complexity of the chromatic number problem
• Zero knowledge and the chromatic number
• Approximating the independence number and the chromatic number in expected polynomial time
• Approximate graph coloring by semidefinite programming
• The greedy coloring is a bad probabilistic algorithm
• On colouring random graphs
• Exact and approximative algorithms for coloring G(n,p)
• Paths in graphs
• MAX k‐CUT and approximating the chromatic number of random graphs
• The Lovász Number of Random Graphs
• The chromatic number of random graphs
• The chromatic number of random graphs

This page was built for publication: An improved algorithm for approximating the chromatic number of \(G_{n,p}\)