Gomes, G. C. M., & Sau, I. (2021). Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. Algorithmica, 83(6), 1677-1706. https://doi.org/10.1007/s00453-021-00798-8
Citace podle Chicago (17th ed.)Gomes, Guilherme C. M., a Ignasi Sau. "Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization." Algorithmica 83, no. 6 (2021): 1677-1706. https://doi.org/10.1007/s00453-021-00798-8.
Citace podle MLA (9th ed.)Gomes, Guilherme C. M., a Ignasi Sau. "Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization." Algorithmica, vol. 83, no. 6, 2021, pp. 1677-1706, https://doi.org/10.1007/s00453-021-00798-8.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..