Cita APA (7a ed.)
Krumplík, M., & Domonkos, T. <The> shortest path problem (multiple edges between two adjacent vertices).
Cita Chicago Style (17a ed.)
Krumplík, Miroslav, y Tomáš Domonkos. <The> Shortest Path Problem (multiple Edges Between Two Adjacent Vertices).
Cita MLA (9a ed.)
Krumplík, Miroslav, y Tomáš Domonkos. <The> Shortest Path Problem (multiple Edges Between Two Adjacent Vertices).
Precaución: Estas citas no son 100% exactas.