Pages that link to "Item:Q5401393"

The following pages link to A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs (Q5401393):

Displaying 8 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)