Analysis of complex network performance and heuristic node removal strategies

DOI10.1016/j.cnsns.2013.04.030zbMath1344.90010OpenAlexW2024023966MaRDI QIDQ312858

Ehsan Jahanpour, Xin Chen

Publication date: 9 September 2016

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2013.04.030

zbMATH Keywords

complex networknetwork centralitynode removal

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Communication theory (94A05)

Related Items (4)

Research of cooperative communication network with both preferential and random attachments ⋮ Energy disruptive centrality with an application to criminal network ⋮ A tight approximation algorithm for the cluster vertex deletion problem ⋮ A tight approximation algorithm for the cluster vertex deletion problem

Cites Work

• Unnamed Item
• Unnamed Item
• Identifying sets of key players in a social network
• Vulnerability of complex networks
• Statistical analysis of network data. Methods and models
• A faster algorithm for betweenness centrality*
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
• Collective dynamics of ‘small-world’ networks
• Networks

This page was built for publication: Analysis of complex network performance and heuristic node removal strategies