Space-efficient parameterized algorithms on graphs of low shrubdepth

DOI10.1145/3723880MaRDI QIDQ6907153zbMATH OpenFDO

Authors Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-Il Oum, Michał Pilipczuk, Erik Jan van Leeuwen

Publication date 4 November 2025

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

zbMATH Keywords

parameterized complexityspace complexityalgebraic methodsshrubdepth

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Space-efficient parameterized algorithms on graphs of low shrubdepth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907153)