Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree

Given a graph G$$ G $$ of degree k$$ k $$ over n$$ n $$ vertices, we consider the problem of computing a near maximum cut or a near minimum bisection in polynomial time. For graphs of girth 2L$$ 2L $$, we develop a local message passing algorithm whose complexity is O(nkL)$$ O(nkL) $$, and that achi...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 63; no. 3; pp. 689 - 715
Main Authors:	El Alaoui, Ahmed, Montanari, Andrea, Sellke, Mark
Format:	Journal Article
Language:	English
Published:	New York John Wiley & Sons, Inc 01.10.2023 Wiley Subscription Services, Inc
Subjects:	Algorithms Apexes Combinatorial analysis graph partionning Graph theory Graphs local algorithms maximum cut Message passing minimum bisection Polynomials Spin glasses
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!