DUCOFFE, GUILLAUME, 2021. FASTER APPROXIMATION ALGORITHMS FOR COMPUTING SHORTEST CYCLES ON WEIGHTED GRAPHS. SIAM Journal on Discrete Mathematics. 1 April 2021. Vol. 35, no. 2, p. 953-969. DOI 10.1137/20 M1330415.
Elsevier - Harvard (with titles)DUCOFFE, G., 2021. FASTER APPROXIMATION ALGORITHMS FOR COMPUTING SHORTEST CYCLES ON WEIGHTED GRAPHS. SIAM Journal on Discrete Mathematics 35, 953-969. https://doi.org/10.1137/20 M1330415
American Psychological Association 7th editionDUCOFFE, G. (2021). FASTER APPROXIMATION ALGORITHMS FOR COMPUTING SHORTEST CYCLES ON WEIGHTED GRAPHS. SIAM Journal on Discrete Mathematics, 35(2), 953-969. https://doi.org/10.1137/20 M1330415
Springer - Basic (author-date)DUCOFFE G (2021) FASTER APPROXIMATION ALGORITHMS FOR COMPUTING SHORTEST CYCLES ON WEIGHTED GRAPHS.. SIAM Journal on Discrete Mathematics 35:953-969. https://doi.org/10.1137/20 M1330415
Juristische Zitierweise (Stüber) (Deutsch)DUCOFFE, GUILLAUME, FASTER APPROXIMATION ALGORITHMS FOR COMPUTING SHORTEST CYCLES ON WEIGHTED GRAPHS., SIAM Journal on Discrete Mathematics 2021, 953-969.