Domatic number

Results: 10



#Item
1Approximating the Domatic Number Uriel Feige∗ Magn´ us M. Halld´orsson†

Approximating the Domatic Number Uriel Feige∗ Magn´ us M. Halld´orsson†

Add to Reading List

Source URL: crab.rutgers.edu

Language: English - Date: 2010-11-22 15:19:49
    2Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch

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

    Add to Reading List

    Source URL: www.tik.ee.ethz.ch

    Language: English - Date: 2015-05-18 12:16:33
    3Approximating 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 to

    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 to

    Add to Reading List

    Source URL: www.tik.ee.ethz.ch

    Language: English - Date: 2015-05-18 12:16:23
    4BRICS Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph On the Number of Maximal Independent Sets

    BRICS Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph On the Number of Maximal Independent Sets

    Add to Reading List

    Source URL: www.brics.dk

    Language: English - Date: 2002-04-12 04:11:55
    5On Chromatic Sums and Distributed Resource Allocation Amotz Bar-Noy∗ Mihir Bellare† Hadas Shachnai§

    On Chromatic Sums and Distributed Resource Allocation Amotz Bar-Noy∗ Mihir Bellare† Hadas Shachnai§

    Add to Reading List

    Source URL: www.cs.technion.ac.il

    Language: English - Date: 2013-04-15 10:45:37
    6CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub

    CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub

    Add to Reading List

    Source URL: cccg.ca

    Language: English - Date: 2010-07-19 10:46:18
    7CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy

    CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m.  Examples:

    Add to Reading List

    Source URL: infolab.stanford.edu

    Language: English - Date: 2008-09-19 00:58:50
    8Microsoft PowerPoint - K-Anonymity.ppt

    Microsoft PowerPoint - K-Anonymity.ppt

    Add to Reading List

    Source URL: www.andrew.cmu.edu

    Language: English - Date: 2012-08-22 17:30:01
    9Dominating Sets in Directed Graphs Chaoyi Pang a,∗ Rui Zhang b Qing Zhang a Junhu Wang c a The Australian e-Health Research Centre, ICT Centre, CSIRO, Australia

    Dominating Sets in Directed Graphs Chaoyi Pang a,∗ Rui Zhang b Qing Zhang a Junhu Wang c a The Australian e-Health Research Centre, ICT Centre, CSIRO, Australia

    Add to Reading List

    Source URL: www.ruizhang.info

    Language: English - Date: 2010-06-07 20:25:43
    10Local Approximation Schemes for Ad Hoc and Sensor ∗ Networks Fabian Kuhn Thomas Moscibroda

    Local Approximation Schemes for Ad Hoc and Sensor ∗ Networks Fabian Kuhn Thomas Moscibroda

    Add to Reading List

    Source URL: distcomp.ethz.ch

    Language: English - Date: 2005-07-23 16:10:38