Pages that link to "Item:Q3464472"
From MaRDI portal
The following pages link to An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs (Q3464472):
Displaying 9 items.
- A data-parallel algorithm for minimum-width tree layout (Q293301) (← links)
- Parallel algorithms for finding the most vital edge with respect to minimum spanning tree (Q1201944) (← links)
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (Q1209346) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- (Q2728889) (← links)
- Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe (Q3688127) (← links)
- (Q4393289) (← links)
- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest (Q4785625) (← links)