Faster graph algorithms through DAG compression

DOI10.4230/LIPICS.STACS.2024.8MaRDI QIDQ6902718zbMATH OpenFDO

Authors Max Bannach, Florian Andreas Marwitz, Till Tantau

Publication date 10 November 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

parameterized algorithmsgraph traversalgraph compressiontwinwidth

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Faster graph algorithms through DAG compression

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