Long directed detours: reduction to 2-disjoint paths
From MaRDI portal
Publication:6551717
DOI10.1016/j.ipl.2024.106491zbMath1541.68289MaRDI QIDQ6551717
Michał Włodarczyk, Ashwin Jacob, Meirav Zehavi
Publication date: 7 June 2024
Published in: Information Processing Letters (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Vertex cover problem parameterized above and below tight bounds
- Solving MAX-\(r\)-SAT above a tight lower bound
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Long directed \((s,t)\)-path: FPT algorithm
- Hamiltonicity below Dirac's condition
- On Multiway Cut Parameterized above Lower Bounds
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- A Remark on Stirling's Formula
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Faster Algebraic Algorithms for Path and Packing Problems
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Color-coding
- Faster Parameterized Algorithms Using Linear Programming
- Going Far from Degeneracy
- Some Theorems on Abstract Graphs
- Parameterization Above a Multiplicative Guarantee
- Simpler and faster algorithms for detours in planar digraphs
- Detours in directed graphs
- Algorithmic extensions of Dirac's theorem
This page was built for publication: Long directed detours: reduction to 2-disjoint paths
