Dehne, F., Ferreira, A., Cáceres, E., Song, S. W., & Roncato, A. (2002). Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP. Algorithmica, 33(2), 183-200. https://doi.org/10.1007/s00453-001-0109-4
Citace podle Chicago (17th ed.)Dehne, F., A. Ferreira, E. Cáceres, S. W. Song, a A. Roncato. "Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP." Algorithmica 33, no. 2 (2002): 183-200. https://doi.org/10.1007/s00453-001-0109-4.
Citace podle MLA (9th ed.)Dehne, F., et al. "Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP." Algorithmica, vol. 33, no. 2, 2002, pp. 183-200, https://doi.org/10.1007/s00453-001-0109-4.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..