Jansen, B. M. P., Pilipczuk, M., & Wrochna, M. (2019). Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. Algorithmica, 81(10), 3936-3967. https://doi.org/10.1007/s00453-019-00614-4
Citácia podle Chicago (17th ed.)Jansen, Bart M. P., Marcin Pilipczuk, a Marcin Wrochna. "Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor." Algorithmica 81, no. 10 (2019): 3936-3967. https://doi.org/10.1007/s00453-019-00614-4.
Citácia podľa MLA (8th ed.)Jansen, Bart M. P., et al. "Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor." Algorithmica, vol. 81, no. 10, 2019, pp. 3936-3967, https://doi.org/10.1007/s00453-019-00614-4.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..