Analysis of Algorithms on the Cores of Random Graphs

DOI10.1007/11830924_2MaRDI QIDQ3595408zbMATH OpenOpenAlexFDO

Authors Nicholas Wormald

Publication date 28 August 2007

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11830924_2

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms (68W40)

Recommendations

• Sudden emergence of a giant k-core in a random graph
• On the robustness of random k-cores
• Encores on cores
• Core forging and local limit theorems for the \(k\)-core of random graphs
• Asymptotic normality of the \(k\)-core in random graphs

Cited in

(6)

• Hardness of peeling with stashes
• Cores of random \(r\)-partite hypergraphs
• scientific article; zbMATH DE number 1890147 (Why is no real title available?)
• Analysis of an Exhaustive Search Algorithm in Random Graphs and the $n^{c\log n}$-Asymptotics
• Mathematical instruments and the education of gentlemen
• On the robustness of random k-cores

This page was built for publication: Analysis of Algorithms on the Cores of Random Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595408)