Pages that link to "Item:Q3540245"

The following pages link to Leveraging Linial’s Locality Limit (Q3540245):

Displaying 14 items.

• Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
• Distributed approximation of capacitated dominating sets (Q613113) (← links)
• Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
• Local approximability of max-min and min-max linear programs (Q693753) (← links)
• A simple local 3-approximation algorithm for vertex cover (Q987844) (← links)
• An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
• Node labels in local decision (Q1625609) (← links)
• What can be verified locally? (Q1672006) (← links)
• Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
• Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← links)
• Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
• Deterministic distributed construction of \(T\)-dominating sets in time \(T\) (Q1786883) (← links)
• Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
• Deterministic Massively Parallel Connectivity (Q6069413) (← links)