Underestimated cost of targeted attacks on complex networks
From MaRDI portal
Publication:1646528
DOI10.1155/2018/9826243zbMath1390.93109arXiv1710.03522OpenAlexW2763430219MaRDI QIDQ1646528
Dijana Tolić, Nino Antulov-Fantulin, Xiao-Long Ren, Niels Gleinig
Publication date: 25 June 2018
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.03522
complex networkstargeted attacksedge removal strategyHierarchical Power Iterative Normalized cut (HPI-Ncut)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Generalized \(k\)-cores of networks under attack with limited knowledge ⋮ Percolation theories for multipartite networked systems under random failures ⋮ Efficient Network Dismantling via Node Explosive Percolation*
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent advances on failure and recovery in networks of networks
- The Mathematics of Infectious Diseases
- Emergence of Scaling in Random Networks
- Authoritative sources in a hyperlinked environment
- Generalized Nested Dissection
- The Structure and Function of Complex Networks
- First-principles multiway spectral partitioning of graphs
- A critical point for random graphs with a given degree sequence
- Collective dynamics of ‘small-world’ networks
- Random Graphs
- Spin Glass approach to the feedback vertex set problem
This page was built for publication: Underestimated cost of targeted attacks on complex networks
