Pages that link to "Item:Q6065240"
From MaRDI portal
The following pages link to A deterministic algorithm for the MST problem in constant rounds of congested clique (Q6065240):
Displaying 5 items.
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- Toward optimal bounds in the congested clique, graph connectivity and MST (Q2796246) (← links)
- md-MST is NP-hard for \(d\geq 3\) (Q2883542) (← links)
- (Q4228499) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)