Author:
Qiao Wen-Bao,Créput Jean-Charles
Publisher
Springer International Publishing
Reference23 articles.
1. Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389–1401 (1957)
2. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48–50 (1956)
3. Boruvka, O.: O jistém problému minimálním (1926)
4. Bader, D.A., Cong, G.: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In: Proceedings of 18th International Parallel and Distributed Processing Symposium, p. 39. IEEE (2004)
5. Harish, P., Vineet, V., Narayanan, P.: Large graph algorithms for massively multithreaded architectures. Technical report, International Institute of Information Technology Hyderabad, IIIT/TR/2009/74 (2009)