Subexponential Parameterized Algorithms
From MaRDI portal
Publication:5428794
DOI10.1007/978-3-540-73420-8_4zbMath1171.68875OpenAlexW2121719107MaRDI QIDQ5428794
Fedor V. Fomin, Dimitrios M. Thilikos, Frederic Dorn
Publication date: 28 November 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_4
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters, Ranking and Drawing in Subexponential Time, Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs, Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs, Dynamic programming for graphs on surfaces