Galby, E., Marx, D., Schepper, P., Sharma, R., & Tale, P. (2024). Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica, 86(5), 1428-1474. https://doi.org/10.1007/s00453-023-01196-y
Citace podle Chicago (17th ed.)Galby, Esther, Dániel Marx, Philipp Schepper, Roohani Sharma, a Prafullkumar Tale. "Domination and Cut Problems on Chordal Graphs with Bounded Leafage." Algorithmica 86, no. 5 (2024): 1428-1474. https://doi.org/10.1007/s00453-023-01196-y.
Citace podle MLA (9th ed.)Galby, Esther, et al. "Domination and Cut Problems on Chordal Graphs with Bounded Leafage." Algorithmica, vol. 86, no. 5, 2024, pp. 1428-1474, https://doi.org/10.1007/s00453-023-01196-y.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..