Jungles, bundles, and fixed-parameter tractability
From MaRDI portal
Publication:5741737
DOI10.1137/1.9781611973105.29zbMath1421.68221arXiv1112.1538OpenAlexW2098198355MaRDI QIDQ5741737
Michał Pilipczuk, Fedor V. Fomin
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.1538
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)
Related Items (8)
Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments ⋮ Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number ⋮ Tournament pathwidth and topological containment ⋮ Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number ⋮ On width measures and topological problems on semi-complete digraphs ⋮ Comparing linear width parameters for directed graphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Digraphs of Bounded Width
This page was built for publication: Jungles, bundles, and fixed-parameter tractability
