Bryant, D., & Scornavacca, C. (2019). An O(nlogn) Time Algorithm for Computing the Path-Length Distance Between Trees. Algorithmica, 81(9), 3692-3706. https://doi.org/10.1007/s00453-019-00594-5
Citace podle Chicago (17th ed.)Bryant, David, a Celine Scornavacca. "An O(nlogn) Time Algorithm for Computing the Path-Length Distance Between Trees." Algorithmica 81, no. 9 (2019): 3692-3706. https://doi.org/10.1007/s00453-019-00594-5.
Citace podle MLA (9th ed.)Bryant, David, a Celine Scornavacca. "An O(nlogn) Time Algorithm for Computing the Path-Length Distance Between Trees." Algorithmica, vol. 81, no. 9, 2019, pp. 3692-3706, https://doi.org/10.1007/s00453-019-00594-5.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..