Problems hard for treewidth but easy for stable gonality
From MaRDI portal
Publication:6039413
DOI10.1007/978-3-031-15914-5_7arXiv2202.06838MaRDI QIDQ6039413
Gunther Cornelissen, Hans L. Bodlaender, Marieke van der Wegen
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.06838
graph algorithms; network flow; graph orientation; parameterized complexity; tree partitions; stable gonality; capacitated dominating set
68R10: Graph theory (including graph drawing) in computer science