dominating set
a set of vertices in a node-link graph such that every vertex is either in the set or adjacent to it
Facts
6 properties- Instance of
- computational problem
- Subclass of
- set
- Part of
- vertex set[3]
- Computational complexity
- NP-complete[6]
- Introduced in
- The Theory of Graphs, Theory of Graphs[7][8]
- Opposite of
- nonblocker[4]
🏷️ Also known as
en dominating set
en dominating set problem
en externally stable set
cs Dominance
de dominierende Menge
es conjunto dominante
es problema del conjunto dominante
fa مجموعه غالب
fr ensemble dominant
fr problème de l'ensemble dominant
he בעית הקבוצה השולטת
he בעיית הקבוצה השולטת
he קבוצה שולטת
hu domináló csúcshalmaz
hu domináló halmaz
it insieme dominante
ja 支配集合
ja 支配集合問題
nl dominerende verzameling
pl Zbiór dominujący
🔖 Identifiers · 6
- Library of Congress Authorities ID
- sh97008149
- OpenAlex ID
- C146661039
- Freebase ID
- /m/05sv8d
- J9U entity ID
- 987007549490505171
- Microsoft Academic ID (discontinued)
- 146661039
- Yale LUX ID
- concept/e3bdba98-fc53-44f4-acbe-eb335e2808bb
🔗 Connections
Computational complexity 1
Instance of 1
Maintained by WikiProject 1
Subclass of 1
Subtypes 1
Press Enter · cited answer in seconds