Montejano, L. P., & Sau, I. (2017). On the complexity of computing the k-restricted edge-connectivity of a graph. Theoretical computer science, 662, 31-39. https://doi.org/10.1016/j.tcs.2016.12.006
Citace podle Chicago (17th ed.)Montejano, Luis Pedro, a Ignasi Sau. "On the Complexity of Computing the K-restricted Edge-connectivity of a Graph." Theoretical Computer Science 662 (2017): 31-39. https://doi.org/10.1016/j.tcs.2016.12.006.
Citace podle MLA (9th ed.)Montejano, Luis Pedro, a Ignasi Sau. "On the Complexity of Computing the K-restricted Edge-connectivity of a Graph." Theoretical Computer Science, vol. 662, 2017, pp. 31-39, https://doi.org/10.1016/j.tcs.2016.12.006.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..