Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization |
scientific article; zbMATH DE number 7357815
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization |
scientific article; zbMATH DE number 7357815 |
Statements
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (English)
0 references
11 June 2021
0 references
matching cut
0 references
bounded degree cut
0 references
parameterized complexity
0 references
FPT algorithm
0 references
polynomial kernel
0 references
distance to cluster
0 references
0 references
