Optimal padded decomposition for bounded treewidth graphs

DOI10.46298/THEORETICS.25.22MaRDI QIDQ6912579zbMATH OpenFDO

Authors Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil S Kumar, Hung Le, Nadym Mallek

Publication date 22 October 2025

Published in TheoretiCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

treewidthmetric embeddingssparse coversmax-flow/min-multicutpadded decompositionspadded partition coverstree-ordered nets

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Distance in graphs (05C12) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Optimal padded decomposition for bounded treewidth graphs

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