Practical parallel Union-Find algorithms for transitive closure and clustering
暂无分享,去创建一个
[1] George Cybenko,et al. Parallel Algorithms For Classification And Clustering , 1988, Optics & Photonics.
[2] Victor Y. Pan,et al. Fast and Efficient Solution of Path Algebra Problems , 1989, J. Comput. Syst. Sci..
[3] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[4] Francis Y. L. Chin,et al. Efficient parallel algorithms for some graph problems , 1982, CACM.
[5] H. V. Jagadish,et al. Multiprocessor Transitive Closure Algorithms , 1988, Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems.
[6] Michael J. Quinn,et al. Designing Efficient Algorithms for Parallel Computers , 1987 .
[7] Uzi Vishkin,et al. An optimal parallel connectivity algorithm , 1984, Discret. Appl. Math..
[8] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .
[9] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[10] Robert E. Benner,et al. Development of Parallel Methods for a $1024$-Processor Hypercube , 1988 .
[11] Jan van Leeuwen,et al. Worst-case Analysis of Set Union Algorithms , 1984, JACM.
[12] Patrick Valduriez,et al. Parallel evaluation of the transitive closure of a database relation , 2005, International Journal of Parallel Programming.
[13] Allan Gottlieb,et al. Highly parallel computing , 1989, Benjamin/Cummings Series in computer science and engineering.
[14] Allan Borodin,et al. Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines , 1984, Inf. Control..
[15] J. Pasciak,et al. Computer solution of large sparse positive definite systems , 1982 .