Survey of local algorithms
From MaRDI portal
Publication:2875112
Recommendations
Cited in
(52)- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time
- Local algorithms for graphs
- A topological perspective on distributed network algorithms
- A hierarchy of local decision
- Weak models of distributed computing, with connections to modal logic
- Making local algorithms wait-free: the case of ring coloring
- Derandomizing local distributed algorithms under bandwidth restrictions
- Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs
- Fast and simple local algorithms for 2-edge dominating sets and 3-total vertex covers
- Efficient algorithms for local ranking
- Distributed coloring and the local structure of unit-disk graphs
- On the distributed complexity of the semi-matching problem
- No sublogarithmic-time approximation scheme for bipartite vertex cover
- Local-Global Phenomena in Graphs
- New techniques and tighter bounds for local computation algorithms
- Best of two local models: centralized local and distributed local algorithms
- Distributed domination on sparse graph classes
- A local approximation algorithm for minimum dominating set problem in anonymous planar networks
- About informatics, distributed computing, and our job: a personal view
- Deterministic local algorithms, unique identifiers, and fractional graph colouring
- Almost stable matchings by truncating the Gale-Shapley algorithm
- scientific article; zbMATH DE number 7559046 (Why is no real title available?)
- Emptiness problems for distributed automata
- Distributed set cover approximation: primal-dual with optimal locality
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs
- What can be verified locally?
- Distributed coloring and the local structure of unit-disk graphs
- A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Oblivious algorithms for the maximum directed cut problem
- scientific article; zbMATH DE number 3902710 (Why is no real title available?)
- Distributed Dominating Set Approximations beyond Planar Graphs
- scientific article; zbMATH DE number 3853143 (Why is no real title available?)
- The topology of local computing in networks
- Efficient computation of sparse structures
- Infinite networks, halting and local algorithms
- Constant-time local computation algorithms
- Analysing local algorithms in location-aware quasi-unit-disk graphs
- Distributed graph algorithms and their complexity: an introduction
- Distributed computing in the asynchronous LOCAL model
- Emptiness problems for distributed automata
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
- How many cooks spoil the soup?
- Large cuts with local algorithms on triangle-free graphs
- A time hierarchy theorem for the LOCAL model
- Computing large independent sets in a single round
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs
- Distributed Computing: A Locality-Sensitive Approach
- Delay and cooperation in nonstochastic bandits
- Local planar domination revisited
- Proof labeling schemes for reachability-related problems in directed graphs
- How Many Cooks Spoil the Soup?
This page was built for publication: Survey of local algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875112)
