Chapelle, M., Cochefert, M., Kratsch, D., Letourneur, R., & Liedloff, M. (2017). Exact exponential algorithms to find tropical connected sets of minimum size. Theoretical computer science, 676, 33-41. https://doi.org/10.1016/j.tcs.2017.03.003
Citácia podle Chicago (17th ed.)Chapelle, Mathieu, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, a Mathieu Liedloff. "Exact Exponential Algorithms to Find Tropical Connected Sets of Minimum Size." Theoretical Computer Science 676 (2017): 33-41. https://doi.org/10.1016/j.tcs.2017.03.003.
Citácia podľa MLA (8th ed.)Chapelle, Mathieu, et al. "Exact Exponential Algorithms to Find Tropical Connected Sets of Minimum Size." Theoretical Computer Science, vol. 676, 2017, pp. 33-41, https://doi.org/10.1016/j.tcs.2017.03.003.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..