Computability of width of submodular partition functions

DOI10.1016/J.EJC.2011.12.010zbMath1257.05134OpenAlexW2179924680MaRDI QIDQ1933647

Petr Škoda

Publication date: 24 January 2013

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.12.010

zbMATH Keywords

tree-widthbranch-width

Mathematics Subject Classification ID

Trees (05C05) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Computability of width of submodular partition functions