Back to Results
First PageMeta Content
NP-complete problems / Dominating set / Approximation algorithm / Domination / Connected dominating set / Domatic number


Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch
Add to Reading List

Document Date: 2015-05-18 12:16:33


Open Document

File Size: 1,04 MB

Share Result on Facebook