Nagamochi, H., & Kawada, T. (2006). Minmax subtree cover problem on cacti. Discrete Applied Mathematics, 154(8), 1254-1263. https://doi.org/10.1016/j.dam.2005.10.013
Citace podle Chicago (17th ed.)Nagamochi, Hiroshi, a Taizo Kawada. "Minmax Subtree Cover Problem on Cacti." Discrete Applied Mathematics 154, no. 8 (2006): 1254-1263. https://doi.org/10.1016/j.dam.2005.10.013.
Citace podle MLA (9th ed.)Nagamochi, Hiroshi, a Taizo Kawada. "Minmax Subtree Cover Problem on Cacti." Discrete Applied Mathematics, vol. 154, no. 8, 2006, pp. 1254-1263, https://doi.org/10.1016/j.dam.2005.10.013.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..