Path contraction faster than \(2^n\) (Q3300757)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7225937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Path contraction faster than \(2^n\) |
scientific article; zbMATH DE number 7225937 |
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
0.8030301928520203
0 references
0.8017289042472839
0 references
0.792263925075531
0 references
