Pages that link to "Item:Q1209346"
From MaRDI portal
The following pages link to An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (Q1209346):
Displaying 14 items.
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018) (← links)
- An O(N log N) minimal spanning tree algorithm for N points in the plane (Q1082081) (← links)
- A parallel recursive shortest spanning tree algorithm for image segmentation in distributed computing environment (Q1288550) (← links)
- Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors (Q1403184) (← links)
- An optimal PRAM algorithm for a spanning tree on trapezoid graphs. (Q1432796) (← links)
- Improving the efficiency of parallel minimum spanning tree algorithms (Q1861567) (← links)
- Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model (Q2704451) (← links)
- (Q2728889) (← links)
- Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe (Q3688127) (← links)
- A parallel algorithm for finding \(K\) minimum spanning trees (Q3982549) (← links)
- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest (Q4785625) (← links)
- RNC-approximation algorithms for the steiner problem (Q5048954) (← links)
- Computing minimum spanning forests on 1- and 2-dimensional processor arrays (Q5096153) (← links)