New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM

From MaRDI portal
Publication:3786431

DOI10.1109/TC.1987.1676869zbMath0643.94044OpenAlexW1821591339MaRDI QIDQ3786431

No author found.

Publication date: 1987

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1987.1676869




Related Items (21)

A new class of parallel algorithms for finding connected components on machines with bit-vector operationsOn efficient parallel strong orientationOptimal parallel verification of minimum spanning trees in logarithmic timeSeparation and lower bounds for ROM and nondeterministic models of parallel computationOn the parallel computation of the biconnected and strongly connected co-components of graphsConnected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAMAn Optimal Parallel Algorithm for Minimum Spanning Trees in Planar GraphsPARALLEL BLOCK-FINDING USING DISTANCE MATRICESA new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithmsA linear systolic algorithm for the connected component problemGraph Connectivity in Log Steps Using Label PropagationThe Swendsen–Wang dynamics on treesAdapting parallel algorithms to the W-stream model, with applications to graph problemsMaintaining bridge-connected and biconnected components on-lineNew fast parallel algorithm for the connected component problem and its VLSI implementationDistributed MST for constant diameter graphsResource bounds for parallel computation of threshold and symmetric functionsApproximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithmsOn the Strongly Connected and Biconnected Components of the Complement of GraphsImproving the efficiency of parallel minimum spanning tree algorithmsA parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs




This page was built for publication: New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM