An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth.

MLA

Baste, Julien, and Dimitri Watel. “An FPT Algorithm for Node-Disjoint Subtrees Problems Parameterized by Treewidth.” Theoretical Computer Science, vol. 990, Apr. 2024, p. N.PAG. EBSCOhost, https://doi.org/10.1016/j.tcs.2024.114406.

APA

Baste, J., & Watel, D. (2024). An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Theoretical Computer Science, 990, N.PAG. https://doi.org/10.1016/j.tcs.2024.114406

Chicago

Baste, Julien, and Dimitri Watel. 2024. “An FPT Algorithm for Node-Disjoint Subtrees Problems Parameterized by Treewidth.” Theoretical Computer Science 990 (April): N.PAG. doi:10.1016/j.tcs.2024.114406.