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 7 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)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
