Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs (Q5056419)
From MaRDI portal
scientific article; zbMATH DE number 7629034
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs |
scientific article; zbMATH DE number 7629034 |
Statements
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs (English)
0 references
8 December 2022
0 references
W[1]-hardness
0 references
exponential time hypothesis
0 references
multiway cut
0 references
multicut
0 references
cut graph
0 references
surface
0 references
