|
|||||
|
|
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs |
|
| Affiliation: | 1. University of Nevada – Reno, Reno, NV 89557, USA;2. University at Buffalo, The State University of New York, Buffalo, NY 14260, USA;1. Department of Computer Science and Information Engineering, National Changhua University of Education, No. 1, Jin De Road, Changhua City, 500, Taiwan R.O.C.;2. Mobile Business Group, Chunghwa Telecom Co., Ltd., Taiwan |
| Abstract: | |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |