Pages that link to "Item:Q992507"
From MaRDI portal
The following pages link to An optimal maximal independent set algorithm for bounded-independence graphs (Q992507):
Displaying 13 items.
- Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- Dynamic networks of finite state machines (Q2292917) (← 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)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems (Q5207898) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- Optimal nearest neighbor queries in sensor networks (Q5899559) (← 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)
