Pages that link to "Item:Q992509"
From MaRDI portal
The following pages link to Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509):
Displaying 34 items.
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
- Distributed algorithms for random graphs (Q888436) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Distributed backup placement (Q2084982) (← links)
- Linial for lists (Q2104037) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs (Q2441507) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Efficient computation of sparse structures (Q2820273) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- (Q5091207) (← links)
- (Q5092346) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5918711) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5925586) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
- Time-optimal construction of overlay networks (Q6096036) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- Distributed dense subgraph detection and low outdegree orientation (Q6535012) (← links)
- Local conflict coloring revisited: Linial for lists (Q6535013) (← links)
- Improved MPC algorithms for MIS, matching, and coloring on trees and beyond (Q6535033) (← links)
- Near-optimal distributed dominating set in bounded arboricity graphs (Q6658821) (← links)
