Fast Dynamic Graph Algorithms for Parameterized Problems
From MaRDI portal
Publication:3188899
DOI10.1007/978-3-319-08404-6_21zbMath1416.68203arXiv1404.7307OpenAlexW103931714MaRDI QIDQ3188899
Publication date: 2 September 2014
Published in: Algorithm Theory – SWAT 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.7307
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items
Multistage vertex cover, Improved approximation algorithms for hitting 3-vertex paths, Dynamic kernels for hitting sets and set packing
