A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest

@article{citeulike:2625759, address = {Philadelphia, PA, USA}, author = {Pettie, Seth and Ramachandran, Vijaya }, citeulike-article-id = {2625759}, doi = {10.1137/S0097539700371065}, issn = {0097-5397}, journal = {SIAM J. Comput.}, keywords = {algorithms, graph, parallel, stochastic}, number = {6}, pages = {1879--1895}, posted-at = {2008-04-03 12:02:00}, priority = {2}, publisher = {Society for Industrial and Applied Mathematics}, title = {A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest}, url = {http://portal.acm.org/citation.cfm?id=586845.586952}, volume = {31}, year = {2002} }

TY - JOUR ID - citeulike:2625759 L3 - citeulike-article-id:2625759 TI - A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest JF - SIAM J. Comput. VL - 31 IS - 6 SP - 1879 EP - 1895 AD - Philadelphia, PA, USA PB - Society for Industrial and Applied Mathematics SN - 0097-5397 KW - algorithms KW - graph KW - parallel KW - stochastic AU - Pettie, Seth AU - Ramachandran, Vijaya PY - 2002/// UR - http://portal.acm.org/citation.cfm?id=586845.586952 ER -