Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts

Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna. Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. In Michael A. Bekos, Michael Kaufmann 0001, editors, Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers. Volume 13453 of Lecture Notes in Computer Science, pages 98-113, Springer, 2022. [doi]

Abstract

Abstract is missing.