Automata, Languages and Programming
From MaRDI portal
Publication:5466478
DOI10.1007/b99859zbMath1098.05073OpenAlexW2505584480MaRDI QIDQ5466478
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Why almost all \(k\)-colorable graphs are easy to color ⋮ MAX k‐CUT and approximating the chromatic number of random graphs ⋮ Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
This page was built for publication: Automata, Languages and Programming
