Breaking a graph into connected components with small dominating sets (Q7241024)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8198819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breaking a graph into connected components with small dominating sets |
scientific article; zbMATH DE number 8198819 |
Statements
Breaking a graph into connected components with small dominating sets (English)
0 references
12 May 2026
0 references
parameterized algorithms
0 references
recursive understanding
0 references
polynomial kernels
0 references
degeneracy
0 references
