Stolee, D., Bourke, C., & Vinodchandran, N. V. (2010, June). A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. 2010 IEEE 25th Annual Conference on Computational Complexity, 131-138. https://doi.org/10.1109/CCC.2010.36
Citace podle Chicago (17th ed.)Stolee, Derrick, Chris Bourke, a N V. Vinodchandran. "A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources." 2010 IEEE 25th Annual Conference on Computational Complexity Jun. 2010: 131-138. https://doi.org/10.1109/CCC.2010.36.
Citace podle MLA (9th ed.)Stolee, Derrick, et al. "A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources." 2010 IEEE 25th Annual Conference on Computational Complexity, Jun. 2010, pp. 131-138, https://doi.org/10.1109/CCC.2010.36.