Path Contraction Faster than $2^n$ (Q3300757)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Path Contraction Faster than $2^n$ |
scientific article |
Statements
Path Contraction Faster than $2^n$ (English)
0 references
30 July 2020
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
