Pages that link to "Item:Q5918122"
From MaRDI portal
The following pages link to Local approximation of the maximum cut in regular graphs (Q5918122):
Displaying 8 items.
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Delta invariant for Eulerian digraphs (Q2079872) (← links)
- Optimum cuts in graphs by general fuzzy connectedness with local band constraints (Q2203345) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- On the Power of Nodes of Degree Four in the Local Max-Cut Problem (Q3563008) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- Local improving algorithms for large cuts in graphs with maximum degree three (Q5937918) (← links)
- Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree (Q6076731) (← links)