Chechik, S., & Zhang, T. (2019, November). Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. Proceedings / annual Symposium on Foundations of Computer Science, 370-381. https://doi.org/10.1109/FOCS.2019.00031
Citace podle Chicago (17th ed.)Chechik, Shiri, a Tianyi Zhang. "Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time." Proceedings / Annual Symposium on Foundations of Computer Science Nov. 2019: 370-381. https://doi.org/10.1109/FOCS.2019.00031.
Citace podle MLA (9th ed.)Chechik, Shiri, a Tianyi Zhang. "Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time." Proceedings / Annual Symposium on Foundations of Computer Science, Nov. 2019, pp. 370-381, https://doi.org/10.1109/FOCS.2019.00031.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..