Pages that link to "Item:Q1060018"
From MaRDI portal
The following pages link to An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018):
Displaying 11 items.
- Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (Q861311) (← links)
- An adaptive parallel algorithm for analyzing activity networks (Q910339) (← links)
- An efficient parallel algorithm for updating minimum spanning trees (Q1105383) (← links)
- On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem. I (Q1158109) (← links)
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (Q1209346) (← links)
- A parallel recursive shortest spanning tree algorithm for image segmentation in distributed computing environment (Q1288550) (← 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)
- On random and adaptive parallel generation of combinatorial objects (Q3989785) (← links)
- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest (Q4785625) (← links)
