支配集合問題
1. Dominating setIn 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 joined to at least one member of D by some edge. 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.
Read “Dominating set” on English Wikipedia
Read “支配集合問題” on Japanese Wikipedia
Read “Dominating set” on DBpedia
Read “Dominating set” on English Wikipedia
Read “支配集合問題” on Japanese Wikipedia
Read “Dominating set” on DBpedia
Discussions
Log in to talk about this word.