Jul 3, 2023 · It has been shown that in graphs of low treedepth it is possible to design algorithms which achieve polynomial space complexity without requiring worse time ...

Jan 13, 2024 · In this work, we are interested in the parameter cliquewidth and its low-depth counterpart: shrubdepth. While treewidth applies only to sparse ...

Aug 30, 2023 · Here, shrubdepth is a bounded-depth analogue of cliquewidth, in the same way as treedepth is a bounded-depth analogue of treewidth. We show that ...

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth · Benjamin Bergougnoux, V. Chekan, +5 authors E. J. V. Leeuwen · Published in Embedded ...

Sep 10, 2024 · Dynamic programming on various graph decompositions is one of the most fundamental techniques used in parameterized complexity.

Mar 7, 2024 · Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. Benjamin Bergougnoux , Vera Chekan , Robert Ganian , Mamadou Moustapha ...

Mar 7, 2024 · ... Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. 31st Annual European Symposium on Algorithms, 2023, AMSTERDAM ...

Parameterized complexity analysis has found great success across numerous fields of computer science, with notable examples including graph algorithms, ...

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias ...

The paper "Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth", co-authored by Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou ...