The Randomized Coloring Procedure with Symmetry-Breaking
From MaRDI portal
Publication:3521929
DOI10.1007/978-3-540-70575-8_26zbMath1153.05332OpenAlexW121118243MaRDI QIDQ3521929
Aravind Srinivasan, Sriram V. Pemmaraju
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_26
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (2)
Asymptotically optimal frugal colouring ⋮ Distributed algorithms for the Lovász local lemma and graph coloring
This page was built for publication: The Randomized Coloring Procedure with Symmetry-Breaking