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
Citace podle Chicago (17th ed.)Babu, Jasine, K. Murali Krishnan, Veena Prabhakaran, a 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.
Citace podle MLA (9th ed.)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.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..