Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2008.11.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2008.11.004 / rank | |||
Normal rank | |||
Latest revision as of 10:53, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding paths of length \(k\) in \(O^{*}(2^k)\) time |
scientific article |
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
