Velasquez, A., Subramani, K., & Wojciechowski, P. (2022). On the complexity of and solutions to the minimum stopping and trapping set problems. Theoretical computer science, 915, 26-44. https://doi.org/10.1016/j.tcs.2022.02.028
Citácia podle Chicago (17th ed.)Velasquez, Alvaro, K. Subramani, a Piotr Wojciechowski. "On the Complexity of and Solutions to the Minimum Stopping and Trapping Set Problems." Theoretical Computer Science 915 (2022): 26-44. https://doi.org/10.1016/j.tcs.2022.02.028.
Citácia podľa MLA (8th ed.)Velasquez, Alvaro, et al. "On the Complexity of and Solutions to the Minimum Stopping and Trapping Set Problems." Theoretical Computer Science, vol. 915, 2022, pp. 26-44, https://doi.org/10.1016/j.tcs.2022.02.028.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..