Citace podle APA (7th ed.)

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

Citace podle Chicago (17th ed.)

Dvořák, Michal, Dušan Knop, a Š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.

Citace podle MLA (9th ed.)

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.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..