Semirandom Models as Benchmarks for Coloring Algorithms

DOI10.1137/1.9781611972962.4zbMath1423.05071OpenAlexW2295468341MaRDI QIDQ5233148

Dan Vilenchik, Michael Krivelevich

Publication date: 16 September 2019

Published in: 2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972962.4

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

On the tractability of coloring semirandom graphs ⋮ The replica symmetric phase of random constraint satisfaction problems ⋮ Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model

This page was built for publication: Semirandom Models as Benchmarks for Coloring Algorithms