The following pages link to Survey of local algorithms (Q2875112):
Displaying 33 items.
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← links)
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- On the distributed complexity of the semi-matching problem (Q736606) (← links)
- A local approximation algorithm for minimum dominating set problem in anonymous planar networks (Q748117) (← links)
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (Q896557) (← links)
- Deterministic local algorithms, unique identifiers, and fractional graph colouring (Q896700) (← links)
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs (Q906392) (← links)
- Node labels in local decision (Q1625609) (← links)
- What can be verified locally? (Q1672006) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) (← links)
- How many cooks spoil the soup? (Q2075625) (← links)
- Proof labeling schemes for reachability-related problems in directed graphs (Q2097332) (← links)
- Local planar domination revisited (Q2097345) (← links)
- Emptiness problems for distributed automata (Q2182732) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (Q2445394) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Efficient computation of sparse structures (Q2820273) (← links)
- How Many Cooks Spoil the Soup? (Q2835012) (← links)
- (Q3384173) (← links)
- (Q5090373) (← links)
- Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
