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 14 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)
- 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)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)