Bhore, S., & Jain, R. (2023). Space-efficient algorithms for reachability in directed geometric graphs. Theoretical computer science, 961, 113938. https://doi.org/10.1016/j.tcs.2023.113938
Citácia podle Chicago (17th ed.)Bhore, Sujoy, a Rahul Jain. "Space-efficient Algorithms for Reachability in Directed Geometric Graphs." Theoretical Computer Science 961 (2023): 113938. https://doi.org/10.1016/j.tcs.2023.113938.
Citácia podľa MLA (8th ed.)Bhore, Sujoy, a Rahul Jain. "Space-efficient Algorithms for Reachability in Directed Geometric Graphs." Theoretical Computer Science, vol. 961, 2023, p. 113938, https://doi.org/10.1016/j.tcs.2023.113938.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..