Large Hypertree Width for Sparse Random Hypergraphs

DOI10.1007/978-3-642-38756-2_30zbMath1303.68095OpenAlexW2397006633MaRDI QIDQ5405941

Ke Xu, Tian Liu, Chaoyi Wang

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38756-2_30

zbMATH Keywords

phase transitionconstraint satisfactionhypertree widthrandom hypergraphModel RBModel RD

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Performances of pure random walk algorithms on constraint satisfaction problems with growing domains ⋮ Bounding the scaling window of random constraint satisfaction problems

This page was built for publication: Large Hypertree Width for Sparse Random Hypergraphs