Laish, I., & Mozes, S. (2019). Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs. Theory of computing systems, 63(8), 1849-1874. https://doi.org/10.1007/s00224-019-09949-5
Citace podle Chicago (17th ed.)Laish, Itay, a Shay Mozes. "Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs." Theory of Computing Systems 63, no. 8 (2019): 1849-1874. https://doi.org/10.1007/s00224-019-09949-5.
Citace podle MLA (9th ed.)Laish, Itay, a Shay Mozes. "Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs." Theory of Computing Systems, vol. 63, no. 8, 2019, pp. 1849-1874, https://doi.org/10.1007/s00224-019-09949-5.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..