Pinter, R. Y., Shachnai, H., & Zehavi, M. (2016). Deterministic parameterized algorithms for the Graph Motif problem. Discrete Applied Mathematics, 213, 162-178. https://doi.org/10.1016/j.dam.2016.04.026
Citácia podle Chicago (17th ed.)Pinter, Ron Y., Hadas Shachnai, a Meirav Zehavi. "Deterministic Parameterized Algorithms for the Graph Motif Problem." Discrete Applied Mathematics 213 (2016): 162-178. https://doi.org/10.1016/j.dam.2016.04.026.
Citácia podľa MLA (8th ed.)Pinter, Ron Y., et al. "Deterministic Parameterized Algorithms for the Graph Motif Problem." Discrete Applied Mathematics, vol. 213, 2016, pp. 162-178, https://doi.org/10.1016/j.dam.2016.04.026.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..