Y. Han, An optimal linked list prefix algorithm on a local memory computer, Proc. 1989. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Planar Strong Connectivity Helps in Parallel Depth-First Search - Kao (1992) (1 citation) (Correct)
....time on n= log n processors. Proof. The edges around a new vertex of G 0 are collected by processing the doubly linked circular lists of the combinatorial embedding of G. The computation takes O(log n) time and n= log n processors, using optimal parallel algorithms for list ranking [5] 9] [13], prefix computation [24] 23] tree contraction [26] 1] 8] 22] 11] 10] and planar connectivity [12] 3. Strongly connected components and directed spanning trees. This section quotes previous results and reports new results on computing strongly connected components and directed ....
....be changed so that r is a boundary vertex on that face. Then, by the strong connectivity of G, it is a bubble graph rooted at r. Therefore, this theorem follows from Theorem 5. 11 and the fact that the external face can be changed in O(logn) time on n= log n processors using list ranking [5] 9] [13] and prefix computation [24] 23] Acknowledgement. The author wishes to thank Subhrajit Bhattacharya for helpful discussions. A. All graphs have cycle separators. The following discussion uses depthfirst search trees to compute graph separators [17] A.1. Path and cycle separators of weighted ....
Y. Han, An optimal linked list prefix algorithm on a local memory computer, IEEE Transactions on Computers, 40 (1991), pp. 1149--1153.
Parallel Integer Sorting Is More Efficient than Parallel.. - Han, Shen (1999) Self-citation (Han) (Correct)
No context found.
Y. Han, An optimal linked list prefix algorithm on a local memory computer, Proc. 1989.
Parallel Algorithm for Linked List and Beyond - Han (1990) Self-citation (Han) (Correct)
No context found.
. Y. Han. An optimal linked list prefix algorithm on a local memory computer. Proc. 1989 ACM Computer Science Conf., Lousville, Kentucky, 278-286(1989).
Matching Partition a Linked List and Its Optimization - Han (1989) (1 citation) Self-citation (Han) (Correct)
No context found.
. Y. Han. An optimal linked list prefix algorithm on a local memory computer. Proc. of the Computer Science Conf. (CSC'89), 278-286(Feb., 1989).
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