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
Chicago Style (17th ed.) CitationChapelle, Mathieu, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, and 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.
MLA (9th ed.) CitationChapelle, 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.