![Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Dominating set / Independent set / Vertex cover / Connected dominating set / Set cover problem / Line graph / Metric k-center / Domatic number Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Dominating set / Independent set / Vertex cover / Connected dominating set / Set cover problem / Line graph / Metric k-center / Domatic number](https://www.pdfsearch.io/img/9fe4aef7c46dffa4565cce8970b94382.jpg) Date: 2015-05-18 12:16:23Graph theory Mathematics Computational complexity theory NP-complete problems Dominating set Independent set Vertex cover Connected dominating set Set cover problem Line graph Metric k-center Domatic number | | Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes toAdd to Reading ListSource URL: www.tik.ee.ethz.chDownload Document from Source Website File Size: 385,33 KBShare Document on Facebook
|