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 3 items.
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← 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)