Pages that link to "Item:Q3652253"
From MaRDI portal
The following pages link to Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs (Q3652253):
Displaying 6 items.
- Distributed algorithms for random graphs (Q888436) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- An estimator for matching size in low arboricity graphs with two applications (Q2106871) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs (Q5091012) (← links)
- Distributed approximation for \(f\)-matching (Q6614001) (← links)
