R. Cole, U. Vishkin, "Approximate and exact parallel techniques with applications to list, tree and graph problems," Proc. 27th Ann. IEEE Symp. on Foundations of Comp. Sci., 1986, pp. 478-491.  Home/Search   Document Not in Database   Summary   Related Articles

....Hence vertex l is contained in an ear P k with k i and hence the endpoints of ear P i are contained on an ear with label smaller than i. Let us analyze the complexity of Algorithm 2.1. Step 1 requires the computation of a spanning tree T and its preorder numbering with respect to the root r [CV86]. Step 2a requires the computation of least common ancestors in T [SV88] Step 2b requires sorting of integers in the range [0: n Gamma 1] C88] Step 3a requires the computation of the minimum value in each adjacency list [KR90] Step 3b can be performed efficiently in parallel by the ....

....from obtaining true optimality. In this context we note the following. 1) Finding connected components: We need to find connected components at several places in our algorithms. At present there is no optimal O(log n) time parallel algorithm known for graph connectivity although the algorithm in [CV86] is almost optimal . However, this algorithm assumes that the graph is represented by its adjacency lists. Even if we assume that the input graph is represented by its adjacency lists, we still need to ensure that the adjacency lists for the various derived graphs used in the algorithms can be ....

R. Cole, U. Vishkin, "Approximate and exact parallel techniques with applications to list, tree and graph problems," Proc. 27th Ann. IEEE Symp. on Foundations of Comp. Sci., 1986, pp. 478-491.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC