Pages that link to "Item:Q4575597"

The following pages link to An Improved Distributed Algorithm for Maximal Independent Set (Q4575597):

Displaying 15 items.

• Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
• Computing large independent sets in a single round (Q1699422) (← links)
• Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
• (Q5002725) (← links)
• (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
• Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
• Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
• Congested Clique Algorithms for Graph Spanners (Q5090933) (← links)
• When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
• Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
• Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
• Node and edge averaged complexities of local graph problems (Q6071120) (← links)
• Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)
• Time-optimal construction of overlay networks (Q6096036) (← links)
• Component stability in low-space massively parallel computation (Q6126138) (← links)