Bressan, M., & Roth, M. (2022, February). Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies. Proceedings / annual Symposium on Foundations of Computer Science, 276-285. https://doi.org/10.1109/FOCS52979.2021.00036
Citace podle Chicago (17th ed.)Bressan, Marco, a Marc Roth. "Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies." Proceedings / Annual Symposium on Foundations of Computer Science Feb. 2022: 276-285. https://doi.org/10.1109/FOCS52979.2021.00036.
Citace podle MLA (9th ed.)Bressan, Marco, a Marc Roth. "Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies." Proceedings / Annual Symposium on Foundations of Computer Science, Feb. 2022, pp. 276-285, https://doi.org/10.1109/FOCS52979.2021.00036.