APA-viite (7. p.)

Eremeev, A., tiedekunta, I., Technology, F. o. I., laitos, T., Systems, D. o. C. S. a. I., Jyväskylä, U. o., & yliopisto, J. (2016). The spanning tree based approach for solving the shortest path problem in social graphs.

Chicago-viite (17. p.)

Eremeev, Andrei, Informaatioteknologian tiedekunta, Faculty of Information Technology, Tietojenkäsittelytieteiden laitos, Department of Computer Science and Information Systems, University of Jyväskylä, ja Jyväskylän yliopisto. The Spanning Tree Based Approach for Solving the Shortest Path Problem in Social Graphs. 2016.

MLA-viite (9. p.)

Eremeev, Andrei, et al. The Spanning Tree Based Approach for Solving the Shortest Path Problem in Social Graphs. 2016.