Galby, E., Marx, D., Schepper, P., Sharma, R., & Tale, P. (2023). Parameterized complexity of multicut in weighted trees. Theoretical computer science, 978, 114174. https://doi.org/10.1016/j.tcs.2023.114174
Citácia podle Chicago (17th ed.)Galby, Esther, Dániel Marx, Philipp Schepper, Roohani Sharma, a Prafullkumar Tale. "Parameterized Complexity of Multicut in Weighted Trees." Theoretical Computer Science 978 (2023): 114174. https://doi.org/10.1016/j.tcs.2023.114174.
Citácia podľa MLA (8th ed.)Galby, Esther, et al. "Parameterized Complexity of Multicut in Weighted Trees." Theoretical Computer Science, vol. 978, 2023, p. 114174, https://doi.org/10.1016/j.tcs.2023.114174.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..