Dynamic programming on bipartite tree decompositions

DOI10.1016/J.JCSS.2025.103722MaRDI QIDQ6885361zbMATH OpenFDO

Authors Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos

Publication date 11 December 2025

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingindependent setpackingvertex coverbipartite graphsmaximum cuttree decompositionodd cycle transversalodd-minors

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Dynamic programming on bipartite tree decompositions

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