k-Core Organization in Complex Networks

DOI10.1007/978-1-4614-0754-6_9zbMath1250.05099OpenAlexW4243240954WikidataQ59280433 ScholiaQ59280433MaRDI QIDQ2913784

G. J. Baxter, S. N. Dorogovtsev, J. F. F. Mendes, Alexander Goltsev

Publication date: 27 September 2012

Published in: Handbook of Optimization in Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0754-6_9

zbMATH Keywords

bootstrap percolationmaximal subgraph in a network

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (6)

Role of intensive and extensive variables in a soup of firms in economy to address long run prices and aggregate data ⋮ A mathematical framework to optimize resilience of interdependent critical infrastructure systems under spatially localized attacks ⋮ Explosive transitions in complex networks' structure and dynamics: percolation and synchronization ⋮ Recent advances on failure and recovery in networks of networks ⋮ The Routing of Complex Contagion in Kleinberg’s Small-World Networks ⋮ Inhomogeneous percolation on multilayer networks

This page was built for publication: k-Core Organization in Complex Networks