Bilò, D., Gualà, L., & Proietti, G. (2014). Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Algorithmica, 68(2), 337-357. https://doi.org/10.1007/s00453-012-9674-y
Citácia podle Chicago (17th ed.)Bilò, Davide, Luciano Gualà, a Guido Proietti. "Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree." Algorithmica 68, no. 2 (2014): 337-357. https://doi.org/10.1007/s00453-012-9674-y.
Citácia podľa MLA (8th ed.)Bilò, Davide, et al. "Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree." Algorithmica, vol. 68, no. 2, 2014, pp. 337-357, https://doi.org/10.1007/s00453-012-9674-y.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..