Pages that link to "Item:Q294847"
From MaRDI portal
The following pages link to Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847):
Displaying 9 items.
- Approximating weighted matchings in parallel (Q845697) (← links)
- Approximating matchings in parallel (Q1261482) (← links)
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- On graph problems in a semi-streaming model (Q2581265) (← links)
- Parallel graph algorithms for finding weighted matchings and subgraphs in computational science (Q2830821) (← links)
- An efficient NC algorithm for approximate maximum weight matching (Q2864855) (← links)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
- (Q3815886) (← links)