Conference
Fast All-Pairs Shortest Paths Algorithm in Large Sparse Graph
| Τίτλος: | Fast All-Pairs Shortest Paths Algorithm in Large Sparse Graph |
|---|---|
| Συγγραφείς: | Yang, Shaofeng, Liu, Xiandong, Wang, Yunting, He, Xin, Tan, Guangming |
| Πηγή: | Proceedings of the 37th International Conference on Supercomputing. :277-288 |
| Διαθεσιμότητα: | http://dl.acm.org/doi/10.1145/3577193.3593728 |
| Βάση Δεδομένων: | ACM Full-Text Collection |
| DOI: | 10.1145/3577193.3593728 |
|---|