Pages that link to "Item:Q5090895"
From MaRDI portal
The following pages link to Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895):
Displaying 6 items.
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Distributed dense subgraph detection and low outdegree orientation (Q6535012) (← links)
- Distributed maximum matching verification in CONGEST (Q6535036) (← links)
- Distributed approximation for \(f\)-matching (Q6614001) (← links)
