On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem.

MLA

Carneiro, Alan Diêgo Aurélio, et al. “On Knot-Free Vertex Deletion: Fine-Grained Parameterized Complexity Analysis of a Deadlock Resolution Graph Problem.” Theoretical Computer Science, vol. 909, Mar. 2022, pp. 97–109. EBSCOhost, https://doi.org/10.1016/j.tcs.2022.01.031.

APA

Carneiro, A. D. A., Protti, F., & Souza, U. dos S. (2022). On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem. Theoretical Computer Science, 909, 97–109. https://doi.org/10.1016/j.tcs.2022.01.031

Chicago

Carneiro, Alan Diêgo Aurélio, Fábio Protti, and Uéverton dos Santos Souza. 2022. “On Knot-Free Vertex Deletion: Fine-Grained Parameterized Complexity Analysis of a Deadlock Resolution Graph Problem.” Theoretical Computer Science 909 (March): 97–109. doi:10.1016/j.tcs.2022.01.031.