Finding Dense Subgraphs in G(n,1/2)

DOI10.1007/978-3-642-12450-1_9zbMath1284.05280OpenAlexW2206868146MaRDI QIDQ3558917

Atish Das Sarma, Amit Deshpande, Ravindran Kannan

Publication date: 11 May 2010

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12450-1_9

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: Finding Dense Subgraphs in G(n,1/2)