Path Contraction Faster Than 2^n (Q5091159)
From MaRDI portal
scientific article; zbMATH DE number 7561504
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Path Contraction Faster Than 2^n |
scientific article; zbMATH DE number 7561504 |
Statements
21 July 2022
0 references
path contraction
0 references
exact exponential time algorithms
0 references
graph algorithms
0 references
enumerating connected sets
0 references
3-disjoint connected subgraphs
0 references
Path Contraction Faster Than 2^n (English)
0 references
