Chen, L., Reidl, F., Rossmanith, P., & Sánchez Villaamil, F. (2018). Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming. Algorithms, 11(7), 98. https://doi.org/10.3390/a11070098
Chicago Style (17th ed.) CitationChen, Li-Hsuan, Felix Reidl, Peter Rossmanith, and Fernando Sánchez Villaamil. "Width, Depth, and Space: Tradeoffs Between Branching and Dynamic Programming." Algorithms 11, no. 7 (2018): 98. https://doi.org/10.3390/a11070098.
MLA (9th ed.) CitationChen, Li-Hsuan, et al. "Width, Depth, and Space: Tradeoffs Between Branching and Dynamic Programming." Algorithms, vol. 11, no. 7, 2018, p. 98, https://doi.org/10.3390/a11070098.
Warning: These citations may not always be 100% accurate.