Denat, T., Harutyunyan, A., Melissinos, N., & Paschos, V. T. (2024). Average-case complexity of a branch-and-bound algorithm for Min Dominating Set. Discrete Applied Mathematics, 345, 4-8. https://doi.org/10.1016/j.dam.2023.11.021
Citácia podle Chicago (17th ed.)Denat, Tom, Ararat Harutyunyan, Nikolaos Melissinos, a Vangelis Th Paschos. "Average-case Complexity of a Branch-and-bound Algorithm for Min Dominating Set." Discrete Applied Mathematics 345 (2024): 4-8. https://doi.org/10.1016/j.dam.2023.11.021.
Citácia podľa MLA (8th ed.)Denat, Tom, et al. "Average-case Complexity of a Branch-and-bound Algorithm for Min Dominating Set." Discrete Applied Mathematics, vol. 345, 2024, pp. 4-8, https://doi.org/10.1016/j.dam.2023.11.021.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..