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

Brand, Cornelius; Ceylan, Esra; Ganian, Robert; Hatschka, Christian; Korchemna, Viktoriia

doi:10.1007/978-3-031-15914-5_8

by Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna

Reference:

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge CutsCornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia KorchemnaGraph-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 Verlag.

Bibtex Entry:

@string{springer="Springer Verlag"}
@inproceedings{BCGHK22,
  author    = {Cornelius Brand and
               Esra Ceylan and
               Robert Ganian and
               Christian Hatschka and
               Viktoriia Korchemna},
  editor    = {Michael A. Bekos and
               Michael Kaufmann},
  title     = {Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based
               on Edge Cuts},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International
               Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022,
               Revised Selected Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {13453},
  pages     = {98--113},
  publisher = {Springer},
  year      = {2022},
  url       = {10.1007/978-3-031-15914-5_8">https://link.springer.com/chapter/10.1007/978-3-031-15914-5_8},
  doi       = {10.1007/978-3-031-15914-5\_8},
  keywords  = {ParAI}
}