scientific article; zbMATH DE number 2038711
From MaRDI portal
Publication:4449176
zbMath1039.68167MaRDI QIDQ4449176
Amin Coja-Oghlan, Vishal Sanwalani, Moore, Cristopher
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190200.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
Spectral techniques applied to sparse random graphs ⋮ Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT ⋮ Random MAX SAT, random MAX CUT, and their phase transitions
This page was built for publication:
