@inproceedings{5acd5da068ad4e85a8d4a17829a60d0c,

title = "EFFICIENT PARALLEL ALGORITHMS FOR GRAPH PROBLEMS.",

abstract = "Efficient techniques for manipulating linked structures in parallel are presented. These techniques work on the EREW machine, which is the weakest shared memory machine. The authors develop algorithms for connected components, spanning trees, minimum spanning trees, and other graph problems. All of these algorithms achieve linear speedup for all but the sparsest graphs. A parallel radix sort algorithm is also presented that is optimal for keys taken from a small range.",

author = "Kruskal, {Clyde P.} and Larry Rudolph and Marc Snir",

year = "1986",

language = "English (US)",

isbn = "0818607246",

series = "Proceedings of the International Conference on Parallel Processing",

publisher = "IEEE",

pages = "869--876",

editor = "Kai Hwang and Jacobs, {Steven M.} and Swartzlander, {Earl E.}",

booktitle = "Proceedings of the International Conference on Parallel Processing",

}