Pages that link to "Item:Q2411507"
From MaRDI portal
The following pages link to Large cuts with local algorithms on triangle-free graphs (Q2411507):
Displaying 10 items.
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- (Q5090928) (← links)
- (Q5092335) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Local approximation of the maximum cut in regular graphs (Q5918122) (← 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)
- Fast distributed algorithms for girth, cycles and small subgraphs (Q6535032) (← links)
- A review on quantum approximate optimization algorithm and its variants (Q6546559) (← links)
- Deterministic near-optimal distributed listing of cliques (Q6658820) (← links)