Pages that link to "Item:Q1341686"
From MaRDI portal
The following pages link to An optimal parallel algorithm for maximal matching (Q1341686):
Displayed 8 items.
- On efficient implicit OBDD-based algorithms for maximal matchings (Q476163) (← 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)
- An efficient parallel graph edge matching algorithm and its applications (Q1288436) (← links)
- A fast and efficient NC algorithm for maximal matching (Q1352118) (← links)
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)