Algorithms and Computation

Volume 4288 of the series Lecture Notes in Computer Science pp 507-516

A Simple Message Passing Algorithm for Graph Partitioning Problems

  • Mikael OnsjöAffiliated withDept. of Computer Sci. and Eng., Chalmers Univ. of Technology
  • , Osamu WatanabeAffiliated withDept. of Math. and Comput. Sci., Tokyo Inst. of Technology

* Final gross prices may vary according to local VAT.

Get Access


Motivated by the belief propagation, we propose a simple and deterministic message passing algorithm for the Graph Bisection problem and related problems. The running time of the main algorithm is linear w.r.t. the number of vertices and edges. For evaluating its average-case correctness, planted solution models are used. For the Graph Bisection problem under the standard planted solution model with probability parameters p and r, we prove that our algorithm yields a planted solution with probability >1–δ if pr=Ω(n − 1/2log(n/δ)).