Chang, Y. (2024). The energy complexity of diameter and minimum cut computation in bounded-genus networks. Theoretical computer science, 982, 114279. https://doi.org/10.1016/j.tcs.2023.114279
Citace podle Chicago (17th ed.)Chang, Yi-Jun. "The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-genus Networks." Theoretical Computer Science 982 (2024): 114279. https://doi.org/10.1016/j.tcs.2023.114279.
Citace podle MLA (9th ed.)Chang, Yi-Jun. "The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-genus Networks." Theoretical Computer Science, vol. 982, 2024, p. 114279, https://doi.org/10.1016/j.tcs.2023.114279.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..