Approximating acyclicity parameters of sparse hypergraphs

DOI10.4230/LIPICS.STACS.2009.1803MaRDI QIDQ5389998zbMATH OpenFDO

Authors 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

graphtreewidthhypergraphhypertree width

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Hypergraphs (05C65) Graph minors (05C83)

Recommendations

• Approximating width parameters of hypergraphs with excluded minors
• Approximating fractional hypertree width
• Approximating fractional hypertree width
• Large hypertree width for sparse random hypergraphs
• Graph-Theoretic Concepts in Computer Science

Cited in

(3)

• Large hypertree width for sparse random hypergraphs
• Large hypertree width for sparse random hypergraphs
• Approximating width parameters of hypergraphs with excluded minors

This page was built for publication: Approximating acyclicity parameters of sparse hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389998)