APA (7th ed.) Citation

Dvořák, M., Knop, D., & Schierreich, Š. (2024). On the Complexity of Target Set Selection in Simple Geometric Networks. Discrete mathematics and theoretical computer science, 26:2(Discrete Algorithms), . https://doi.org/10.46298/dmtcs.11591

Chicago Style (17th ed.) Citation

Dvořák, Michal, Dušan Knop, and Šimon Schierreich. "On the Complexity of Target Set Selection in Simple Geometric Networks." Discrete Mathematics and Theoretical Computer Science 26:2, no. Discrete Algorithms (2024). https://doi.org/10.46298/dmtcs.11591.

MLA (9th ed.) Citation

Dvořák, Michal, et al. "On the Complexity of Target Set Selection in Simple Geometric Networks." Discrete Mathematics and Theoretical Computer Science, vol. 26:2, no. Discrete Algorithms, 2024, https://doi.org/10.46298/dmtcs.11591.