Pages that link to "Item:Q5368958"
From MaRDI portal
The following pages link to Distributed Approximation of Maximum Independent Set and Maximum Matching (Q5368958):
Displaying 18 items.
- On the distributed complexity of the semi-matching problem (Q736606) (← links)
- A new distributed approximation algorithm for the maximum weight independent set problem (Q1793873) (← links)
- Optimal distributed covering algorithms (Q2689837) (← links)
- A log-star distributed maximal independent set algorithm for growth-bounded graphs (Q2934330) (← links)
- Distributed Algorithm for Better Approximation of the Maximum Matching (Q3082932) (← links)
- (Q4250185) (← links)
- An Improved Distributed Algorithm for Maximal Independent Set (Q4575597) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
- (Q5090928) (← links)
- Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
- Distributed Maximal Independent Set using Small Messages (Q5236233) (← links)
- Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets (Q5855210) (← links)
- Simple and local independent set approximation (Q5919021) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications (Q6488445) (← links)
- Improved distributed approximations for maximum independent set (Q6535034) (← links)
- Distributed maximum matching verification in CONGEST (Q6535036) (← links)