Pages that link to "Item:Q5138354"
From MaRDI portal
The following pages link to Some simple distributed algorithms for sparse networks (Q5138354):
Displaying 26 items.
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks (Q555319) (← links)
- Distributed algorithms for random graphs (Q888436) (← links)
- The coverage-control optimization in sensor network subject to sensing area (Q1029837) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Distributed backup placement in networks (Q1741963) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- Almost global problems in the LOCAL model (Q1981631) (← links)
- Distributed backup placement (Q2084982) (← links)
- Linial for lists (Q2104037) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Improved distributed degree splitting and edge coloring (Q2189174) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) (← links)
- Optimal distributed covering algorithms (Q2689837) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- Distributed Graph Coloring: Fundamentals and Recent Developments (Q4980035) (← links)
- Almost global problems in the LOCAL model (Q5090898) (← links)
- Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- Distributed half-integral matching and beyond (Q6199402) (← links)
