Parallel algorithms for the connected components and minimal spanning tree problems
From MaRDI portal
Publication:1162158
DOI10.1016/0020-0190(82)90131-4zbMath0479.68069MaRDI QIDQ1162158
Publication date: 1982
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(82)90131-4
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Optimal parallel algorithms on planar graphs, Efficient parallel term matching and anti-unification, Graph algorithms on a tree-structured parallel computer, An adaptive and cost-optimal parallel algorithm for minimum spanning trees, Determining connected components in linear time by a linear number of processors, A randomized NC algorithm for the maximal tree cover problem, Static and dynamic parallel computation of connected components, A new class of parallel algorithms for finding connected components on machines with bit-vector operations, Parallel algorithms for the domination problems in trapezoid graphs, Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM, Efficient minimum spanning tree algorithms on the reconfigurable mesh, On the parallel computation of the biconnected and strongly connected co-components of graphs, SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS, Parallel computations on graphs, New fast parallel algorithm for the connected component problem and its VLSI implementation, On the Strongly Connected and Biconnected Components of the Complement of Graphs
Cites Work
