Gutenberg, M. P., & Wulff-Nilsen, C. (2020, January 29). Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. arXiv.org. https://doi.org/10.48550/arxiv.2001.10809
Citace podle Chicago (17th ed.)Gutenberg, Maximilian Probst, a Christian Wulff-Nilsen. "Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler." ArXiv.org 29 Jan. 2020. https://doi.org/10.48550/arxiv.2001.10809.
Citace podle MLA (9th ed.)Gutenberg, Maximilian Probst, a Christian Wulff-Nilsen. "Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler." ArXiv.org, 29 Jan. 2020, https://doi.org/10.48550/arxiv.2001.10809.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..