APA-Zitierstil (7. Ausg.)

Mescoff, G., Paul, C., & Thilikos, D. M. (2022). A polynomial time algorithm to compute the connected treewidth of a series–parallel graph. Discrete Applied Mathematics, 312, 72-85. https://doi.org/10.1016/j.dam.2021.02.039

Chicago-Zitierstil (17. Ausg.)

Mescoff, Guillaume, Christophe Paul, und Dimitrios M. Thilikos. "A Polynomial Time Algorithm to Compute the Connected Treewidth of a Series–parallel Graph." Discrete Applied Mathematics 312 (2022): 72-85. https://doi.org/10.1016/j.dam.2021.02.039.

MLA-Zitierstil (9. Ausg.)

Mescoff, Guillaume, et al. "A Polynomial Time Algorithm to Compute the Connected Treewidth of a Series–parallel Graph." Discrete Applied Mathematics, vol. 312, 2022, pp. 72-85, https://doi.org/10.1016/j.dam.2021.02.039.