Pages that link to "Item:Q2006778"
From MaRDI portal
The following pages link to A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778):
Displaying 4 items.
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract) (Q2817625) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)