Lokshtanov, D., Ramanujan, M., & Saurabh, S. (2026). When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices. Journal of combinatorial theory. Series B, 177, 143-185. https://doi.org/10.1016/j.jctb.2025.11.002
Citace podle Chicago (17th ed.)Lokshtanov, Daniel, M.S Ramanujan, a Saket Saurabh. "When Recursion Is Better than Iteration: A Linear-time Algorithm for Directed Acyclicity with Few Error Vertices." Journal of Combinatorial Theory. Series B 177 (2026): 143-185. https://doi.org/10.1016/j.jctb.2025.11.002.
Citace podle MLA (9th ed.)Lokshtanov, Daniel, et al. "When Recursion Is Better than Iteration: A Linear-time Algorithm for Directed Acyclicity with Few Error Vertices." Journal of Combinatorial Theory. Series B, vol. 177, 2026, pp. 143-185, https://doi.org/10.1016/j.jctb.2025.11.002.