Embracing the giant component
From MaRDI portal
Publication:5704836
DOI10.1002/rsa.20070zbMath1077.05090MaRDI QIDQ5704836
Abraham D. Flaxman, Gregory B. Sorkin, David Gamarnik
Publication date: 15 November 2005
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20070
Related Items
Coloring the edges of a random graph without a monochromatic giant component, Small subgraphs in random graphs and the power of multiple choices, Connected components and evolution of random graphs: An algebraic approach, A geometric Achlioptas process, The Bohman-Frieze process near criticality, Delaying satisfiability for random 2SAT, Getting a Directed Hamilton Cycle Two Times Faster, Hamiltonicity thresholds in Achlioptas processes, Ramsey games with giants, Random k -SAT and the power of two choices, Avoiding small subgraphs in Achlioptas processes
Cites Work