Cite
Typical Sequences Revisited — Computing Width Parameters of Graphs
MLA
Bodlaender, Hans L., et al. “Typical Sequences Revisited — Computing Width Parameters of Graphs.” Theory of Computing Systems, vol. 67, Mar. 2021, pp. 52–88. EBSCOhost, https://doi.org/10.1007/s00224-021-10030-3.
APA
Bodlaender, H. L., Jaffke, L., Telle, J. A., Paul, C., Bläser, M., Sub Algorithms and Complexity, & Algorithms and Complexity. (2021). Typical Sequences Revisited — Computing Width Parameters of Graphs. Theory of Computing Systems, 67, 52–88. https://doi.org/10.1007/s00224-021-10030-3
Chicago
Bodlaender, Hans L., Lars Jaffke, Jan Arne Telle, Christophe Paul, Markus Bläser, Sub Algorithms and Complexity, and Algorithms and Complexity. 2021. “Typical Sequences Revisited — Computing Width Parameters of Graphs.” Theory of Computing Systems 67 (March): 52–88. doi:10.1007/s00224-021-10030-3.