Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
DOI10.1137/S0097539701396807zbMath1062.03028OpenAlexW2001130632WikidataQ59259692 ScholiaQ59259692MaRDI QIDQ4651468
Georg Gottlob, Reinhard Pichler
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539701396807
Database theory (68P15) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13)
Related Items (3)
This page was built for publication: Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width