American Psychological Association 6th edition

Guo, X., Yu, W., & Liu, Z. (2025). Approximating the maximum weight cycle/path partition in graphs with weights one and two. Journal of Combinatorial Optimization, 49(5). https://doi.org/10.1007/s10878-025-01322-2

ISO-690 (author-date, English)

GUO, Xinmeng, YU, Wei und LIU, Zhaohui, 2025. Approximating the maximum weight cycle/path partition in graphs with weights one and two. Journal of Combinatorial Optimization. 1 Juli 2025. Vol. 49, no. 5, . DOI 10.1007/s10878-025-01322-2.

Modern Language Association 9th edition

Guo, X., W. Yu, und Z. Liu. „Approximating the Maximum Weight cycle/Path Partition in Graphs With Weights One and Two“. Journal of Combinatorial Optimization, Bd. 49, Nr. 5, Juli 2025, https://doi.org/10.1007/s10878-025-01322-2.

Mohr Siebeck - Recht (Deutsch - Österreich)

Guo, Xinmeng/Yu, Wei/Liu, Zhaohui: Approximating the maximum weight cycle/path partition in graphs with weights one and two, Journal of Combinatorial Optimization 2025,

Emerald - Harvard

Guo, X., Yu, W. und Liu, Z. (2025), „Approximating the maximum weight cycle/path partition in graphs with weights one and two“, Journal of Combinatorial Optimization, Vol. 49 No. 5, verfügbar unter:https://doi.org/10.1007/s10878-025-01322-2.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.