scientific article; zbMATH DE number 6027237

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

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

Publication date: 24 April 2012

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graphhypergraphtreewidthhypertree width

Mathematics Subject Classification ID

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

Related Items (1)

Myhill-Nerode Methods for Hypergraphs

This page was built for publication: