Pages that link to "Item:Q1073573"
From MaRDI portal
The following pages link to A fast and simple randomized parallel algorithm for maximal matching (Q1073573):
Displayed 33 items.
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
- Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- A simple randomized parallel algorithm for maximal f-matchings (Q672735) (← links)
- An improvement on parallel computation of a maximal matching (Q672837) (← links)
- The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Parallel complexity of computing a maximal set of disjoint paths (Q1186594) (← links)
- Fast RNC and NC algorithms for maximal path sets (Q1285573) (← links)
- An efficient parallel graph edge matching algorithm and its applications (Q1288436) (← links)
- Removing randomness in parallel computation without a processor penalty (Q1309384) (← links)
- An optimal parallel algorithm for maximal matching (Q1341686) (← links)
- A fast and efficient NC algorithm for maximal matching (Q1352118) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
- On the Microscopic View of Time and Messages (Q4686647) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Distributed half-integral matching and beyond (Q6148072) (← links)
- The maximal f-dependent set problem for planar graphs is in NC (Q6184372) (← links)
- Fast RNC and NC algorithms for finding a maximal set of paths with an application (Q6184665) (← links)
- Distributed half-integral matching and beyond (Q6199402) (← links)
- (1- <i>ϵ</i> )-Approximate Maximum Weighted Matching in poly(1/ <i>ϵ</i> , log <i>n</i> ) Time in the Distributed and Parallel Settings (Q6202220) (← links)