Pages that link to "Item:Q5361911"
From MaRDI portal
The following pages link to MST in Log-Star Rounds of Congested Clique (Q5361911):
Displayed 16 items.
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Approximate minimum directed spanning trees under congestion (Q2117742) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- Sparsifying Congested Cliques and Core-Periphery Networks (Q2835033) (← links)
- (Q5090922) (← links)
- (Q5092346) (← links)
- (Q5121896) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
- Fault-tolerant graph realizations in the congested clique (Q6112001) (← links)
- Exact distributed sampling (Q6148084) (← links)
- Distributed PageRank computation with improved round complexities (Q6195176) (← links)
- Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? (Q6202240) (← links)
- Deterministic Fault-Tolerant Connectivity Labeling Scheme (Q6202245) (← links)