Publication:5389998

DOI10.4230/LIPIcs.STACS.2009.1803zbMath1236.68089MaRDI QIDQ5389998

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

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_ce51.html

zbMATH Keywords

graph; hypergraph; treewidth; hypertree width

Mathematics Subject Classification ID

05C65: Hypergraphs

05C83: Graph minors

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)