Ramalingam, G., & Reps, T. (1996). On the computational complexity of dynamic graph problems. Theoretical computer science, 158(1), 233-277. https://doi.org/10.1016/0304-3975(95)00079-8
Citace podle Chicago (17th ed.)Ramalingam, G., a Thomas Reps. "On the Computational Complexity of Dynamic Graph Problems." Theoretical Computer Science 158, no. 1 (1996): 233-277. https://doi.org/10.1016/0304-3975(95)00079-8.
Citace podle MLA (9th ed.)Ramalingam, G., a Thomas Reps. "On the Computational Complexity of Dynamic Graph Problems." Theoretical Computer Science, vol. 158, no. 1, 1996, pp. 233-277, https://doi.org/10.1016/0304-3975(95)00079-8.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..