Pages that link to "Item:Q3756533"
From MaRDI portal
The following pages link to A Simple Parallel Algorithm for the Maximal Independent Set Problem (Q3756533):
Displaying 15 items.
- Time-optimal construction of overlay networks (Q6096036) (← links)
- Beyond the worst-case bisection bound: Fast sorting and ranking on meshes (Q6102292) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- A note on the network coloring game: a randomized distributed \((\Delta+1)\)-coloring algorithm (Q6161445) (← links)
- Universal Hashing via Integer Arithmetic Without Primes, Revisited (Q6163629) (← links)
- The maximal f-dependent set problem for planar graphs is in NC (Q6184372) (← links)
- Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications (Q6488445) (← links)
- Improved MPC algorithms for MIS, matching, and coloring on trees and beyond (Q6535033) (← links)
- Distributed maximum matching verification in CONGEST (Q6535036) (← links)
- Coloring fast without learning your neighbors' colors (Q6535038) (← links)
- Parallel approximation of optimization problems (Q6560202) (← links)
- Randomized parallel algorithms (Q6560203) (← links)
- Self-stabilizing \((\varDelta +1)\)-coloring in sublinear (in \(\varDelta\)) rounds via locally-iterative algorithms (Q6591474) (← links)
- Resource efficient stabilization for local tasks despite unknown capacity links (Q6612539) (← links)
- Luby's MIS algorithms made self-stabilizing (Q6663516) (← links)
