Pages that link to "Item:Q4876697"
From MaRDI portal
The following pages link to On the Complexity of Distributed Network Decomposition (Q4876697):
Displayed 26 items.
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
- Distributed algorithms for random graphs (Q888436) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- Distributed backup placement (Q2084982) (← links)
- Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
- Randomized distributed decision (Q2256969) (← links)
- Dynamic networks of finite state machines (Q2292917) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← 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)
- On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
- SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS (Q3063603) (← links)
- Local Maps: New Insights into Mobile Agent Algorithms (Q3540225) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)