A Simple Message Passing Algorithm for Graph Partitioning Problems

DOI10.1007/11940128_51zbMath1135.68523OpenAlexW1568252223MaRDI QIDQ5459145

Mikael Onsjö, Osamu Watanabe

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_51

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Message passing algorithms for MLS-3LIN problem ⋮ Comparative study for inference of hidden classes in stochastic block models ⋮ Finding most likely solutions

This page was built for publication: A Simple Message Passing Algorithm for Graph Partitioning Problems