Publication:845732: Difference between revisions
From MaRDI portal
Publication:845732
Created automatically from import240313020336 |
(No difference)
|
Latest revision as of 14:46, 13 March 2024
DOI10.1016/J.IPL.2006.05.004zbMATH Open1184.05041OpenAlexW2007944679MaRDI QIDQ845732FDOQ845732
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
Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate graph coloring by semidefinite programming
- Paths in graphs
- On colouring random graphs
- The chromatic number of random graphs
- Zero knowledge and the chromatic number
- The greedy coloring is a bad probabilistic algorithm
- The chromatic number of random graphs
- A note on the complexity of the chromatic number problem
- Approximating the independence number and the chromatic number in expected polynomial time
- Exact and approximative algorithms for coloring G(n,p)
- The Lovász Number of Random Graphs
- MAX k‐CUT and approximating the chromatic number of random graphs
Cited In (1)
This page was built for publication: An improved algorithm for approximating the chromatic number of \(G_{n,p}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845732)