Domatic number - PDFSEARCH.IO - Document Search Engine

Domatic number
Results: 10

#	Item
1	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
2	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 NP-complete problems Dominating set Approximation algorithm Domination Connected dominating set Domatic number
3	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 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
4	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 NP-complete problems Maximal independent set Independent set Graph coloring Clique Extremal graph theory Domatic number Path decomposition Graph theory Theoretical computer science Mathematics
5	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 Graph coloring NP-complete problems Edge coloring Independent set Matching Maximal independent set Interval graph Bipartite graph Domatic number Graph theory Mathematics Theoretical computer science
6	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 NP-complete problems Graph coloring Domatic number Dominating set Independent set Greedy coloring Topology Maximal independent set Graph Graph theory Theoretical computer science Mathematics
7	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 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory
8	Microsoft PowerPoint - K-Anonymity.ppt Add to Reading List Source URL: www.andrew.cmu.edu Language: English - Date: 2012-08-22 17:30:01 NP-complete problems Graph partition Graph Matching Hypergraph Domatic number Graph theory Theoretical computer science Mathematics
9	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 NP-complete problems Dominating set Directed graph Group action Connected dominating set Domatic number Graph theory Theoretical computer science Mathematics
10	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 NP-complete problems Dominating set Unit disk graph Connected dominating set Graph coloring Independent set Polynomial-time approximation scheme Bidimensionality Domatic number Graph theory Theoretical computer science Computational complexity theory

UPDATE