A backtracking-based algorithm for hypertree decomposition

DOI10.1145/1412228.1412229zbMath1284.05284WikidataQ59259617 ScholiaQ59259617MaRDI QIDQ5406168

Georg Gottlob, Marko Samer

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1412228.1412229

zbMATH Keywords

constraint satisfaction; hypertree decomposition

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

05C65: Hypergraphs

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)