Meeks, K., & Scott, A. (2016). The parameterised complexity of list problems on graphs of bounded treewidth. Information and computation, 251, 91-103. https://doi.org/10.1016/j.ic.2016.08.001
Chicago-Zitierstil (17. Ausg.)Meeks, Kitty, und Alexander Scott. "The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth." Information and Computation 251 (2016): 91-103. https://doi.org/10.1016/j.ic.2016.08.001.
MLA-Zitierstil (9. Ausg.)Meeks, Kitty, und Alexander Scott. "The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth." Information and Computation, vol. 251, 2016, pp. 91-103, https://doi.org/10.1016/j.ic.2016.08.001.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.