American Psychological Association 6th edition

Guo, L., & Li, P. (2021). On the complexity of and algorithms for detecting k-length negative cost cycles. Journal of Combinatorial Optimization, 42(3), 396-408. https://doi.org/10.1007/s10878-018-00371-0

ISO-690 (author-date, English)

GUO, Longkun und LI, Peng, 2021. On the complexity of and algorithms for detecting k-length negative cost cycles. Journal of Combinatorial Optimization. 1 Oktober 2021. Vol. 42, no. 3, p. 396-408. DOI 10.1007/s10878-018-00371-0.

Modern Language Association 9th edition

Guo, L., und P. Li. „On the Complexity of and Algorithms for Detecting K-Length Negative Cost Cycles“. Journal of Combinatorial Optimization, Bd. 42, Nr. 3, Oktober 2021, S. 396-08, https://doi.org/10.1007/s10878-018-00371-0.

Mohr Siebeck - Recht (Deutsch - Österreich)

Guo, Longkun/Li, Peng: On the complexity of and algorithms for detecting k-length negative cost cycles, Journal of Combinatorial Optimization 2021, 396-408.

Emerald - Harvard

Guo, L. und Li, P. (2021), „On the complexity of and algorithms for detecting k-length negative cost cycles“, Journal of Combinatorial Optimization, Vol. 42 No. 3, S. 396-408.

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