On the Power of Planned Infections in Networks

DOI10.1080/15427951.2014.982312zbMath1461.68022OpenAlexW1979163032MaRDI QIDQ4985791

Sanjeev Khanna, Moez Draief, Michael Brautbar

Publication date: 26 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2014.982312

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Internet topics (68M11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees: A survey
• On approximating the longest path in a graph
• On a connection between the existence of k-trees and the toughness of a graph
• Efficiency of scale-free networks: Error and attack tolerance
• Not every 2-tough graph is Hamiltonian
• Toughness in graphs -- a survey
• Hamiltonian results inK1,3-free graphs
• On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
• Approximating the Minimum-Degree Steiner Tree to within One of Optimal
• Graphs with specified degree distributions, simple epidemics, and local vaccination strategies

This page was built for publication: On the Power of Planned Infections in Networks