APA (7th ed.) Citation

Babu, J., Murali Krishnan, K., Prabhakaran, V., & Warrier, N. J. (2025). Computing eternal vertex cover number of maximal outerplanar graphs in linear time. Theoretical computer science, 1056, 115530. https://doi.org/10.1016/j.tcs.2025.115530

Chicago Style (17th ed.) Citation

Babu, Jasine, K. Murali Krishnan, Veena Prabhakaran, and Nandini J. Warrier. "Computing Eternal Vertex Cover Number of Maximal Outerplanar Graphs in Linear Time." Theoretical Computer Science 1056 (2025): 115530. https://doi.org/10.1016/j.tcs.2025.115530.

MLA (9th ed.) Citation

Babu, Jasine, et al. "Computing Eternal Vertex Cover Number of Maximal Outerplanar Graphs in Linear Time." Theoretical Computer Science, vol. 1056, 2025, p. 115530, https://doi.org/10.1016/j.tcs.2025.115530.