Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q2915204> ?p ?o }
Showing triples 1 to 60 of
60
with 100 triples per page.
- Q2915204 subject Q6465276.
- Q2915204 subject Q7132783.
- Q2915204 subject Q7481159.
- Q2915204 abstract "Template:ForIn graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G.The dominating set problem concerns testing whether γ(G) ≤ K for a given graph G and input K; it is a classical NP-complete decision problem in computational complexity theory (Garey & Johnson 1979). Therefore it is believed that there is no efficient algorithm that finds a smallest dominating set for a given graph.Figures (a)–(c) on the right show three examples of dominating sets for a graph. In each example, each white vertex is adjacent to at least one red vertex, and it is said that the white vertex is dominated by the red vertex. The domination number of this graph is 2: the examples (b) and (c) show that there is a dominating set with 2 vertices, and it can be checked that there is no dominating set with only 1 vertex for this graph.".
- Q2915204 thumbnail Dominating-set.svg?width=300.
- Q2915204 wikiPageExternalLink phdthesis.pdf.
- Q2915204 wikiPageExternalLink node11.html.
- Q2915204 wikiPageExternalLink algorithms.dominating.html.
- Q2915204 wikiPageWikiLink Q1060343.
- Q2915204 wikiPageWikiLink Q1065144.
- Q2915204 wikiPageWikiLink Q1137554.
- Q2915204 wikiPageWikiLink Q1192100.
- Q2915204 wikiPageWikiLink Q131476.
- Q2915204 wikiPageWikiLink Q1378376.
- Q2915204 wikiPageWikiLink Q141488.
- Q2915204 wikiPageWikiLink Q1570441.
- Q2915204 wikiPageWikiLink Q1709878.
- Q2915204 wikiPageWikiLink Q1734364.
- Q2915204 wikiPageWikiLink Q177646.
- Q2915204 wikiPageWikiLink Q18205611.
- Q2915204 wikiPageWikiLink Q191307.
- Q2915204 wikiPageWikiLink Q205084.
- Q2915204 wikiPageWikiLink Q215206.
- Q2915204 wikiPageWikiLink Q2393193.
- Q2915204 wikiPageWikiLink Q2835897.
- Q2915204 wikiPageWikiLink Q3115549.
- Q2915204 wikiPageWikiLink Q3262192.
- Q2915204 wikiPageWikiLink Q3343067.
- Q2915204 wikiPageWikiLink Q3387984.
- Q2915204 wikiPageWikiLink Q3406706.
- Q2915204 wikiPageWikiLink Q380679.
- Q2915204 wikiPageWikiLink Q3893853.
- Q2915204 wikiPageWikiLink Q4653447.
- Q2915204 wikiPageWikiLink Q4956329.
- Q2915204 wikiPageWikiLink Q5129750.
- Q2915204 wikiPageWikiLink Q5161409.
- Q2915204 wikiPageWikiLink Q5282038.
- Q2915204 wikiPageWikiLink Q5337698.
- Q2915204 wikiPageWikiLink Q5366944.
- Q2915204 wikiPageWikiLink Q5467387.
- Q2915204 wikiPageWikiLink Q547823.
- Q2915204 wikiPageWikiLink Q621751.
- Q2915204 wikiPageWikiLink Q6465276.
- Q2915204 wikiPageWikiLink Q7000696.
- Q2915204 wikiPageWikiLink Q7132783.
- Q2915204 wikiPageWikiLink Q7454787.
- Q2915204 wikiPageWikiLink Q746242.
- Q2915204 wikiPageWikiLink Q7481159.
- Q2915204 wikiPageWikiLink Q761631.
- Q2915204 wikiPageWikiLink Q7661893.
- Q2915204 wikiPageWikiLink Q7888149.
- Q2915204 wikiPageWikiLink Q7938022.
- Q2915204 wikiPageWikiLink Q831672.
- Q2915204 wikiPageWikiLink Q843550.
- Q2915204 wikiPageWikiLink Q854280.
- Q2915204 wikiPageWikiLink Q913598.
- Q2915204 wikiPageWikiLink Q924044.
- Q2915204 comment "Template:ForIn graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G.The dominating set problem concerns testing whether γ(G) ≤ K for a given graph G and input K; it is a classical NP-complete decision problem in computational complexity theory (Garey & Johnson 1979).".
- Q2915204 label "Dominating set".
- Q2915204 depiction Dominating-set.svg.
