✦ LIBER ✦

Finding the probability of infection in an SIR network is NP-Hard

✍ Scribed by Shapiro, Michael; Delgado-Eckert, Edgar

Book ID: 120044188
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 525 KB
Volume: 240
Category: Article
ISSN: 0025-5564
DOI: 10.1016/j.mbs.2012.07.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the maximum a posteriori probabi

Finding the maximum a posteriori probability (MAP) in a Bayesian taxonomic key is NP-hard

✍ Fischbacher, Urs 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 509 KB

Minimizing the size of an identifying or

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

✍ Irène Charon; Olivier Hudry; Antoine Lobstein 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 144 KB

Let G = (V; E) be an undirected graph and C a subset of vertices. If the sets Br(v) ∩ C, v ∈ V (respectively, v ∈ V \C), are all nonempty and di erent, where Br(v) denotes the set of all points within distance r from v, we call C an r-identifying code (respectively, an r-locating-dominating code). W