Robustness and Strong Attack Tolerance of Low-Diameter Networks

DOI10.1007/978-1-4614-3906-6_7zbMath1268.90120OpenAlexW309944MaRDI QIDQ5326889

Alexander Veremyev, Vladimir L. Boginski

Publication date: 1 August 2013

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationrobust network design\(k\)-clubs\(R\)-robust \(k\)-clubsstrong attack tolerance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (9)

Finding maximum subgraphs with relatively large vertex connectivity ⋮ On the number of edges in a graph with many two-hop disjoint paths ⋮ Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs ⋮ On robust clusters of minimum cardinality in networks ⋮ Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks ⋮ Potential energy principles in networked systems and their connections to optimization problems on graphs ⋮ On the chance-constrained minimum spanning \(k\)-core problem ⋮ Trade-offs among degree, diameter, and number of paths

Cites Work

• Unnamed Item
• Unnamed Item
• The \(k\) edge-disjoint 3-hop-constrained paths polytope
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
• A new linearization technique for multi-quadratic 0-1 programming problems.
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
• On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
• On the \(k\) edge-disjoint 2-hop-constrained paths polytope
• Novel approaches for analyzing biological networks
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
• A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
• An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
• The minimum augmentation of any graph to aK-edge-connected graph
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Augmentation Problems
• A graph‐theoretic generalization of the clique concept
• The 2-path network problem
• Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
• Simpler and faster biconnectivity augmentation
• On Critical Graphs of Diameter 2

This page was built for publication: Robustness and Strong Attack Tolerance of Low-Diameter Networks