Pages that link to "Item:Q2969665"
From MaRDI portal
The following pages link to Local Algorithms for Sparse Spanning Graphs (Q2969665):
Displaying 10 items.
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Constructing near spanning trees with few local inspections (Q2977565) (← links)
- A Local Algorithm for Constructing Spanners in Minor-Free Graphs (Q4636471) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- On the probe complexity of local computation algorithms (Q5002725) (← links)
- (Q5002766) (← links)
- (Q5090437) (← links)
- Improved Local Computation Algorithm for Set Cover via Sparsification (Q5146979) (← links)
- Limits of local algorithms over sparse random graphs (Q5892454) (← links)