Pages that link to "Item:Q5401393"
From MaRDI portal
The following pages link to A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs (Q5401393):
Displaying 15 items.
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs (Q437046) (← links)
- Independent sets in graphs (Q501998) (← links)
- A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Impact of locality on location aware unit disk graphs (Q1662429) (← links)
- A new distributed approximation algorithm for the maximum weight independent set problem (Q1793873) (← links)
- A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs (Q1958631) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Distributed backup placement (Q2084982) (← links)
- PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs (Q2352346) (← links)
- Distributed strong diameter network decomposition (Q2672581) (← links)
