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

Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna
January 2022
PDF bib Project DOI

Abstract

Full Citation:

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

Type
Conference Paper
ParAI
Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.

Christian Hatschka
Christian Hatschka

Christian Hatschka was a Project Assistant at the Algorithms and Complexity Group.