Tarjan, R. E. (1997). Dynamic trees as search trees via euler tours, applied to the network simplex algorithm. Mathematical programming, 78(2), 169-177. https://doi.org/10.1007/BF02614369
Citace podle Chicago (17th ed.)Tarjan, Robert E. "Dynamic Trees as Search Trees via Euler Tours, Applied to the Network Simplex Algorithm." Mathematical Programming 78, no. 2 (1997): 169-177. https://doi.org/10.1007/BF02614369.
Citace podle MLA (9th ed.)Tarjan, Robert E. "Dynamic Trees as Search Trees via Euler Tours, Applied to the Network Simplex Algorithm." Mathematical Programming, vol. 78, no. 2, 1997, pp. 169-177, https://doi.org/10.1007/BF02614369.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..