The following pages link to On the locality of bounded growth (Q5177224):
Displaying 18 items.
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- Using the doubling dimension to analyze the generalization of learning algorithms (Q923877) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Distributed construction of low-interference spanners (Q2377128) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Coloring unstructured radio networks (Q2377260) (← links)
- Distributed strong diameter network decomposition (Q2672581) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Leveraging Linial’s Locality Limit (Q3540245) (← links)
- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs (Q3602842) (← links)
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes (Q5458525) (← links)
- (Q5743466) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
