Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree (Q6076731)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree |
scientific article; zbMATH DE number 7751070
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree |
scientific article; zbMATH DE number 7751070 |
Statements
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree (English)
0 references
17 October 2023
0 references
graph partionning
0 references
maximum cut
0 references
minimum bisection
0 references
local algorithms
0 references
message passing
0 references
0 references
0 references
0 references
0.93219376
0 references
0.93219376
0 references
0.9229739
0 references
0.9134736
0 references
0.8980759
0 references
0.8900728
0 references
0.88735414
0 references
0.8872614
0 references
