Azar, Y., Feige, U., & Glasner, D. (2010). A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. Algorithmica, 57(3), 517-537. https://doi.org/10.1007/s00453-009-9305-4
Citace podle Chicago (17th ed.)Azar, Yossi, Uriel Feige, a Daniel Glasner. "A Preemptive Algorithm for Maximizing Disjoint Paths on Trees." Algorithmica 57, no. 3 (2010): 517-537. https://doi.org/10.1007/s00453-009-9305-4.
Citace podle MLA (9th ed.)Azar, Yossi, et al. "A Preemptive Algorithm for Maximizing Disjoint Paths on Trees." Algorithmica, vol. 57, no. 3, 2010, pp. 517-537, https://doi.org/10.1007/s00453-009-9305-4.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..