Le, H., & Le, V. B. (2026). Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles. Journal of computer and system sciences, 156, 103723. https://doi.org/10.1016/j.jcss.2025.103723
Citace podle Chicago (17th ed.)Le, Hoang-Oanh, a Van Bang Le. "Complexity and Algorithms for Matching Cut Problems in Graphs Without Long Induced Paths and Cycles." Journal of Computer and System Sciences 156 (2026): 103723. https://doi.org/10.1016/j.jcss.2025.103723.
Citace podle MLA (9th ed.)Le, Hoang-Oanh, a Van Bang Le. "Complexity and Algorithms for Matching Cut Problems in Graphs Without Long Induced Paths and Cycles." Journal of Computer and System Sciences, vol. 156, 2026, p. 103723, https://doi.org/10.1016/j.jcss.2025.103723.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..