Baste, J., & Watel, D. (2024). An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Theoretical computer science, 990, 114406. https://doi.org/10.1016/j.tcs.2024.114406
Citácia podle Chicago (17th ed.)Baste, Julien, a Dimitri Watel. "An FPT Algorithm for Node-disjoint Subtrees Problems Parameterized by Treewidth." Theoretical Computer Science 990 (2024): 114406. https://doi.org/10.1016/j.tcs.2024.114406.
Citácia podľa MLA (8th ed.)Baste, Julien, a Dimitri Watel. "An FPT Algorithm for Node-disjoint Subtrees Problems Parameterized by Treewidth." Theoretical Computer Science, vol. 990, 2024, p. 114406, https://doi.org/10.1016/j.tcs.2024.114406.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..