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):
Displayed 13 items.
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Distributed algorithms for random graphs (Q888436) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← 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)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- (Q3300802) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)