Pages that link to "Item:Q976105"
From MaRDI portal
The following pages link to Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105):
Displaying 24 items.
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- (Q5075762) (← links)
- (Q5075790) (← links)
- (Q5090939) (← links)
- (Q5090953) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
- Decomposition of Map Graphs with Applications. (Q5091217) (← links)
- (Q5092488) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- (Q5140739) (← links)
- Shortest Two Disjoint Paths in Polynomial Time (Q5244398) (← links)
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem (Q5323046) (← links)
- Exact Weight Subgraphs and the k-Sum Conjecture (Q5326545) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- (Q5743488) (← links)
- (Q5743515) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)
- Number of cycles of small length in a graph (Q6063171) (← links)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- Detours in directed graphs (Q6113279) (← links)
- Long directed detours: reduction to 2-disjoint paths (Q6551717) (← links)
- Approximating long cycle above Dirac's guarantee (Q6586667) (← links)