APA-Zitierstil (7. Ausg.)

Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2021). On the query complexity of estimating the distance to hereditary graph properties. SIAM journal on discrete mathematics, 35(2), . https://doi.org/10.1137/19M1283951

Chicago-Zitierstil (17. Ausg.)

Hoppen, Carlos, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, und Henrique Stagni. "On the Query Complexity of Estimating the Distance to Hereditary Graph Properties." SIAM Journal on Discrete Mathematics 35, no. 2 (2021). https://doi.org/10.1137/19M1283951.

MLA-Zitierstil (9. Ausg.)

Hoppen, Carlos, et al. "On the Query Complexity of Estimating the Distance to Hereditary Graph Properties." SIAM Journal on Discrete Mathematics, vol. 35, no. 2, 2021, https://doi.org/10.1137/19M1283951.