Pages that link to "Item:Q2272387"
From MaRDI portal
The following pages link to Faster deterministic parameterized algorithm for \(k\)-path (Q2272387):
Displaying 11 items.
- Long directed \((s,t)\)-path: FPT algorithm (Q1799598) (← links)
- A note on algebraic techniques for subgraph detection (Q2122786) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- QUBO formulations of the longest path problem (Q2658047) (← links)
- Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms (Q2672945) (← links)
- Computing Pathwidth Faster Than 2 n (Q3656873) (← links)
- (Q5075790) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)
- Detours in directed graphs (Q6113279) (← links)
- On kernels for \(d\)-path vertex cover (Q6564612) (← links)