Measuring the robustness of a network using minimal vertex covers

DOI10.1016/j.matcom.2014.04.001zbMath1467.68144OpenAlexW2068828391WikidataQ60246096 ScholiaQ60246096MaRDI QIDQ2229891

Eduardo Sáenz-de-Cabezón, Henry P. Wynn

Publication date: 18 February 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2014.04.001

zbMATH Keywords

covering degreecovering indexnetwork robustnessminimal vertex covers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Types of signature analysis in reliability based on Hilbert series ⋮ The Algebraic Method in Tree Percolation

Uses Software

• NetworkX

Cites Work

• Unnamed Item
• Unnamed Item
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Combinatorial Commutative Algebra
• Reducibility among Combinatorial Problems
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Measuring the robustness of a network using minimal vertex covers