Tight algorithms for connectivity problems parameterized by clique-width

DOI10.4230/LIPICS.ESA.2023.59MaRDI QIDQ6657014zbMATH OpenFDO

Authors Falko Hegerfeld, Stefan Kratsch

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.59

zbMATH Keywords

clique-widthconnectivitycut\&countlower boundparameterized complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• New perspectives on semiring applications to dynamic programming
• A tight Monte-Carlo algorithm for Steiner tree parameterized by clique-width
• Structural parameterizations for induced and acyclic matching
• Tight bounds for some classical problems parameterized by cutwidth

This page was built for publication: Tight algorithms for connectivity problems parameterized by clique-width

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