Pages that link to "Item:Q1162158"
From MaRDI portal
The following pages link to Parallel algorithms for the connected components and minimal spanning tree problems (Q1162158):
Displaying 16 items.
- Optimal parallel algorithms on planar graphs (Q582094) (← links)
- Efficient parallel term matching and anti-unification (Q688582) (← links)
- Graph algorithms on a tree-structured parallel computer (Q797290) (← links)
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018) (← links)
- Determining connected components in linear time by a linear number of processors (Q1108033) (← links)
- A randomized NC algorithm for the maximal tree cover problem (Q1183479) (← links)
- Static and dynamic parallel computation of connected components (Q1322111) (← links)
- A new class of parallel algorithms for finding connected components on machines with bit-vector operations (Q1328526) (← links)
- Parallel algorithms for the domination problems in trapezoid graphs (Q1356505) (← links)
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
- Efficient minimum spanning tree algorithms on the reconfigurable mesh (Q1975444) (← links)
- On the parallel computation of the biconnected and strongly connected co-components of graphs (Q2383544) (← links)
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (Q3130161) (← links)
- Parallel computations on graphs (Q3221400) (← links)
- New fast parallel algorithm for the connected component problem and its VLSI implementation (Q3358233) (← links)
- On the Strongly Connected and Biconnected Components of the Complement of Graphs (Q3439158) (← links)
