Propagation Connectivity of Random Hypergraphs

DOI10.1007/978-3-642-04944-6_10zbMath1260.68444OpenAlexW1665077956MaRDI QIDQ5902240

Robert Berke, Mikael Onsjö

Publication date: 19 November 2009

Published in: Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL: http://ddd.uab.cat/record/60946

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Nonnumerical algorithms (68W05) Hypergraphs (05C65)

Related Items (2)

Message passing algorithms for MLS-3LIN problem ⋮ Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation

Cites Work

• Unnamed Item
• Unnamed Item
• An Efficient Sparse Regularity Concept
• Some optimal inapproximability results
• Efficient Prüfer-Like Coding and Counting Labelled Hypertrees

This page was built for publication: Propagation Connectivity of Random Hypergraphs