Variants of Spreading Messages
From MaRDI portal
Publication:5897120
DOI10.1007/978-3-642-11440-3_22zbMath1274.68689OpenAlexW1871855421MaRDI QIDQ5897120
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan
Publication date: 9 February 2010
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_22
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
Establishing herd immunity is hard even in simple geometric networks ⋮ Triggering cascades on undirected connected graphs ⋮ Constant thresholds can make target set selection tractable
This page was built for publication: Variants of Spreading Messages