Finding Large Independent Sets in Polynomial Expected Time

DOI10.1017/S0963548306007553zbMath1104.68080OpenAlexW2086041504MaRDI QIDQ3412105

Amin Coja-Oghlan

Publication date: 5 December 2006

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548306007553

zbMATH Keywords

random graph

Mathematics Subject Classification ID

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)

Related Items (1)

On independent sets in random graphs

This page was built for publication: Finding Large Independent Sets in Polynomial Expected Time