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...

Celý popis

Podrobná bibliografia

Vydané v:	Random structures & algorithms Ročník 63; číslo 3; s. 689 - 715
Hlavní autori:	El Alaoui, Ahmed, Montanari, Andrea, Sellke, Mark
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York John Wiley & Sons, Inc 01.10.2023 Wiley Subscription Services, Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!