A Simple Message Passing Algorithm for Graph Partitioning Problems

DOI10.1007/11940128_51MaRDI QIDQ5459145zbMATH OpenOpenAlexFDO

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

Recommendations

• Publication:4941836
• Max Cut for Random Graphs with a Planted Partition
• Algorithms for graph partitioning on the planted partition model
• Belief propagation for graph partitioning
• The minimum bisection in the planted bisection model

Cited in

(8)

• Belief propagation for graph partitioning
• Comparative study for inference of hidden classes in stochastic block models
• Finding most likely solutions
• A Class of Optimal Structures for Node Computations in Message Passing Algorithms
• scientific article; zbMATH DE number 1418276 (Why is no real title available?)
• Message passing for the coloring problem: Gallager meets Alon and Kahale
• Message passing algorithms for MLS-3LIN problem
• Partitioning graphs on message-passing machines by pairwise mincut

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459145)