Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105)
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 paths of length k in O^*(2ᵏ) time |
scientific article; zbMATH DE number 5721993
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding paths of length \(k\) in \(O^{*}(2^k)\) time |
scientific article; zbMATH DE number 5721993 |
Statements
Finding paths of length \(k\) in \(O^{*}(2^k)\) time (English)
0 references
16 June 2010
0 references
randomized algorithms
0 references
parameterized algorithms
0 references
graph algorithms
0 references
group algebra
0 references
0.8266828656196594
0 references
0.8255830407142639
0 references
