nonblocker
complement of a dominating set of vertices
Press Enter · cited answer in seconds
0 sources
nonblocker
Summary
nonblocker is a computational problem[1].
Key Facts
- nonblocker's instance of is recorded as computational problem[2].
- nonblocker's subclass of is recorded as set[3].
- nonblocker's part of is recorded as vertex set[4].
- nonblocker's opposite of is recorded as dominating set[5].
- nonblocker's Google Knowledge Graph ID is recorded as /g/11f33p8rjm[6].
- nonblocker's computational complexity is recorded as SNP[7].
- nonblocker's computational complexity is recorded as FPT[8].