Tight bounds for counting colorings and connected edge sets parameterized by cutwidth

DOI10.4230/LIPICS.STACS.2022.36MaRDI QIDQ6490982zbMATH OpenFDO

Authors Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi

Publication date 23 April 2024

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2022.36

zbMATH Keywords

coloringsconnected edge setscounting modulo \(p\)cutwidthparameterized algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(4)

• Towards tight bounds for the graph homomorphism problem parameterized by cutwidth via asymptotic matrix parameters
• A tight Monte-Carlo algorithm for Steiner tree parameterized by clique-width
• Towards exact structural thresholds for parameterized complexity
• Structural parameterizations for two bounded degree problems revisited

This page was built for publication: Tight bounds for counting colorings and connected edge sets parameterized by cutwidth

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