The vertex attack tolerance of complex networks
From MaRDI portal
Publication:4578160
DOI10.1051/ro/2017008zbMath1403.90218OpenAlexW2584020499MaRDI QIDQ4578160
Jeffrey Borwey, Gunes Ercal, John Matta
Publication date: 8 August 2018
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2017008
Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- On the computational complexity of vertex integrity and component order connectivity
- Recognizing tough graphs is NP-hard
- Eigenvalues and expanders
- Approximate counting, uniform generation and rapidly mixing Markov chains
- The eigenvalues of random symmetric matrices
- Tough graphs and Hamiltonian circuits. (Reprint)
- A faster algorithm for betweenness centrality*
- Emergence of Scaling in Random Networks
- Relations between average case complexity and approximation complexity
- Improved approximation algorithms for minimum-weight vertex separators
- On Maximal Circuits in Finite Graphs
- The vertex attack tolerance of complex networks
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs
- Algorithms and Computation
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- SOFSEM 2006: Theory and Practice of Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The vertex attack tolerance of complex networks
