Pages that link to "Item:Q524360"

The following pages link to Local computation algorithms for graphs of non-constant degrees (Q524360):

Displaying 8 items.

• Best of two local models: centralized local and distributed local algorithms (Q1784947) (← 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)
• (Q5090437) (← links)
• When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
• Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
• Average Sensitivity of Graph Algorithms (Q6046751) (← links)