Finding detours is fixed-parameter tractable
From MaRDI portal
Publication:5111385
Recommendations
Cited in
(10)- Long directed detours: reduction to 2-disjoint paths
- The tree longest detour problem in a biconnected graph.
- Faster deterministic parameterized algorithm for k-path
- scientific article; zbMATH DE number 7525484 (Why is no real title available?)
- Basic Terminology, Notation and Results
- Detours in directed graphs
- Longest cycle above Erdős-Gallai bound
- Long directed \((s,t)\)-path: FPT algorithm
- Finding detours is fixed-parameter tractable
- Longest cycle above Erdős-Gallai bound
This page was built for publication: Finding detours is fixed-parameter tractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111385)