Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492855
DOI10.1007/11549345zbMath1156.05337OpenAlexW2494705596MaRDI QIDQ5492855
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Semidefinite programming (90C22) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
A Spectral Method for MAX2SAT in the Planted Solution Model ⋮ Why almost all \(k\)-colorable graphs are easy to color
This page was built for publication: Mathematical Foundations of Computer Science 2005