Pages that link to "Item:Q3540245"
From MaRDI portal
The following pages link to Leveraging Linial’s Locality Limit (Q3540245):
Displaying 22 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)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692) (← links)
- A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (Q2445394) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Fast Distributed Approximations in Planar Graphs (Q3540222) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
