Add to ORKGWe present a new approach to finding minimum spanning trees of weighted undirected graphs on the parallel random access machine (PRAM) without concurrent-write power. This approach gives an algorithm that runs in O(log n) time using n+m processors on the EREW PRAM, settling a long-standing open problem in the literature.published_or_final_versio
We present the first randomized O(logn) time and O(m + n) work EREW PRAM algorithm for finding a sp...
AbstractPart I of this paper presented a novel technique for approximate parallel scheduling and a n...
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci call...
AbstractThis paper presents results which improve the efficiency of parallel algorithms for computin...
We present a simple and implementable algorithm that computes a minimum spanning tree of an undirect...
This paper resolves a long-standing open problem on whether the concurrent write capability of paral...
AbstractImproving a long chain of works, we obtain a randomised EREW PRAM algorithm for finding the ...
Let G be a connected, undirected and weighted graph with n vertices and m edges. A most vital edge o...
Lower and upper bounds for finding a minimum spanning tree (MST) in a weighted undirected graph on t...
AbstractFinding the connected components of an undirected graphG=(V, E) onn=|V| vertices andm=|E| ed...
AbstractA new parallel algorithm for updating the minimum spanning tree of an n-vertex graph followi...
AbstractAssume that G(V,E) is a weighted, undirected, connected graph with n vertices. The k most vi...
Lower and upper bounds for finding a minimum spanning tree (MST) in a weighted undirected graph on t...
Computing the minimum spanning tree of the graph is one of the fundamental computational problems. I...
Lower and upper bounds for finding a minimum spanning tree (MST) in a weighted undirected graph on t...
We present the first randomized O(logn) time and O(m + n) work EREW PRAM algorithm for finding a sp...
AbstractPart I of this paper presented a novel technique for approximate parallel scheduling and a n...
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci call...
AbstractThis paper presents results which improve the efficiency of parallel algorithms for computin...
We present a simple and implementable algorithm that computes a minimum spanning tree of an undirect...
This paper resolves a long-standing open problem on whether the concurrent write capability of paral...
AbstractImproving a long chain of works, we obtain a randomised EREW PRAM algorithm for finding the ...
Let G be a connected, undirected and weighted graph with n vertices and m edges. A most vital edge o...
Lower and upper bounds for finding a minimum spanning tree (MST) in a weighted undirected graph on t...
AbstractFinding the connected components of an undirected graphG=(V, E) onn=|V| vertices andm=|E| ed...
AbstractA new parallel algorithm for updating the minimum spanning tree of an n-vertex graph followi...
AbstractAssume that G(V,E) is a weighted, undirected, connected graph with n vertices. The k most vi...
Lower and upper bounds for finding a minimum spanning tree (MST) in a weighted undirected graph on t...
Computing the minimum spanning tree of the graph is one of the fundamental computational problems. I...
Lower and upper bounds for finding a minimum spanning tree (MST) in a weighted undirected graph on t...
We present the first randomized O(logn) time and O(m + n) work EREW PRAM algorithm for finding a sp...
AbstractPart I of this paper presented a novel technique for approximate parallel scheduling and a n...
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci call...