Approximating Width Parameters of Hypergraphs with Excluded Minors

DOI10.1137/080743226zbMath1237.05141OpenAlexW1973538949WikidataQ60488542 ScholiaQ60488542MaRDI QIDQ3225125

Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach

Publication date: 15 March 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0a059e9a73886c9eb183a1ad3dc0d59cbd0a1cec

zbMATH Keywords

approximationhypergraphshypertree widthminor-free graphshypergraph acyclicity

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Approximating Width Parameters of Hypergraphs with Excluded Minors