Abstract
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 p–r=Ω(n − 1/2log(n/δ)).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boppana, R.B.: Eigenvalues and graph bisection: an average-case analysis. In: Proc. Symposium on Foundations of Computer Science, pp. 280–285 (1987)
Bui, T., Chaudhuri, S., Leighton, F., Spiser, M.: Graph bisection algorithms with good average behavior. Combinatorica 7, 171–191 (1987)
Coja-Oghlan, A.: A spectral heuristic for bisecting random graphs. In: Proc. SODA 2005, pp. 850–859 (2005), (The journal version will appear Random Structures and Algorithms)
Condon, A., Karp, R.: Algorithms for graph partitioning on the planted partition model. Random Str. and Algorithms 18, 116–140 (2001)
Dubhashi, D., Laura, L., Panconesi, A.: Analysis and experimental evaluation of a simple algorithm for collaborative filtering in planted partition models. In: Proc. FST TCS 2003, pp. 168–182 (2003)
Dyer, M.E., Frieze, A.M.: The solution of some random NP-hard problems in polynomial expected time. J. of Algorithms 10, 451–489 (1989)
Garey, M.R., Johnson, D.S.: Computers and Intractability, Bell Telephone Laboratories, Incorporated (1979)
Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1, 237–267 (1976)
Jerrum, M., Sorkin, G.: The Metropolis algorithm for graph bisection. Discrete Appl. Math. 82(1-3), 155–175 (1998)
Hahnloser, R., Seung, H., Slotine, J.: Permitted and forbidden sets in threshold-linear networks. Neural Computation 15, 621–638 (2003)
McSherry, F.: Spectral partition of random graphs. In: Proc. 40th IEEE Sympos. on Foundations of Computer Science (FOCS 1999), pp. 529–537. IEEE, Los Alamitos (1999)
Onsjö, M.: Master Thesis (2005)
Onsjö, M., Watanabe, O.: Simple algorithms for graph partition problems, Research Report C-212, Dept. of Math. and Comput. Sci., Tokyo Inst. of Tech. (2005)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., San Francisco (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Onsjö, M., Watanabe, O. (2006). A Simple Message Passing Algorithm for Graph Partitioning Problems. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_51
Download citation
DOI: https://doi.org/10.1007/11940128_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49694-6
Online ISBN: 978-3-540-49696-0
eBook Packages: Computer ScienceComputer Science (R0)