Pages that link to "Item:Q524360"
From MaRDI portal
The following pages link to Local computation algorithms for graphs of non-constant degrees (Q524360):
Displaying 15 items.
- Localization of edges in graph models of two-level algorithms (Q1582914) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- On the recognition of families of graphs with local computations (Q1891139) (← 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)
- On the probe complexity of local computation algorithms (Q5002725) (← links)
- (Q5090437) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- Foundations of Software Science and Computation Structures (Q5308444) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Local improving algorithms for large cuts in graphs with maximum degree three (Q5937918) (← links)
- Average Sensitivity of Graph Algorithms (Q6046751) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
