dominating set
a set of vertices in a node-link graph such that every vertex is either in the set or adjacent to it
Press Enter · cited answer in seconds
0 sources
dominating set
Summary
dominating set is a computational problem[1]. It draws 135 Wikipedia views per month (computational_problem category, ranking #22 of 61).[2]
Key Facts
- dominating set's instance of is recorded as computational problem[3].
- dominating set's Library of Congress authority ID is recorded as sh97008149[4].
- dominating set's subclass of is recorded as set[5].
- dominating set's part of is recorded as vertex set[6].
- dominating set's Commons category is recorded as Dominating set (graph theory)[7].
- dominating set's opposite of is recorded as nonblocker[8].
- dominating set's Freebase ID is recorded as /m/05sv8d[9].
- dominating set's maintained by WikiProject is recorded as WikiProject Mathematics[10].
- dominating set's Microsoft Academic ID is recorded as 146661039[11].
- dominating set's National Library of Israel J9U ID is recorded as 987007549490505171[12].
- dominating set's OpenAlex ID is recorded as C146661039[13].
- dominating set's computational complexity is recorded as NP-complete[14].
- dominating set's introduced in is recorded as The Theory of Graphs[15].
- dominating set's introduced in is recorded as Theory of Graphs[16].
- dominating set's Yale LUX ID is recorded as concept/e3bdba98-fc53-44f4-acbe-eb335e2808bb[17].
Why It Matters
dominating set draws 135 Wikipedia views per month (computational_problem category, ranking #22 of 61).[2] It has Wikipedia articles in 13 language editions, a strong signal of global cultural recognition.[18] It is known by 8 alternative names across languages and contexts.[19]