Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization (Q5875553)
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 7650227
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization |
scientific article; zbMATH DE number 7650227 |
Statements
3 February 2023
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
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization (English)
0 references
