Pages that link to "Item:Q2851862"
From MaRDI portal
The following pages link to A Local Computation Approximation Scheme to Maximum Matching (Q2851862):
Displayed 10 items.
- Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- (Q5002766) (← links)
- (Q5090437) (← links)
- Average Sensitivity of Graph Algorithms (Q6046751) (← links)