APA-Zitierstil (7. Ausg.)

Golovach, P. A., Heggernes, P., & Kratsch, D. (2016). Enumerating minimal connected dominating sets in graphs of bounded chordality. Theoretical computer science, 630, 63-75. https://doi.org/10.1016/j.tcs.2016.03.026

Chicago-Zitierstil (17. Ausg.)

Golovach, Petr A., Pinar Heggernes, und Dieter Kratsch. "Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality." Theoretical Computer Science 630 (2016): 63-75. https://doi.org/10.1016/j.tcs.2016.03.026.

MLA-Zitierstil (9. Ausg.)

Golovach, Petr A., et al. "Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality." Theoretical Computer Science, vol. 630, 2016, pp. 63-75, https://doi.org/10.1016/j.tcs.2016.03.026.