APA (7th ed.) Citation

Hinz, A. M., & Holz auf der Heide, C. (2014). An efficient algorithm to determine all shortest paths in Sierpiński graphs. Discrete Applied Mathematics, 177, 111-120. https://doi.org/10.1016/j.dam.2014.05.049

Chicago Style (17th ed.) Citation

Hinz, Andreas M., and Caroline Holz auf der Heide. "An Efficient Algorithm to Determine All Shortest Paths in Sierpiński Graphs." Discrete Applied Mathematics 177 (2014): 111-120. https://doi.org/10.1016/j.dam.2014.05.049.

MLA (9th ed.) Citation

Hinz, Andreas M., and Caroline Holz auf der Heide. "An Efficient Algorithm to Determine All Shortest Paths in Sierpiński Graphs." Discrete Applied Mathematics, vol. 177, 2014, pp. 111-120, https://doi.org/10.1016/j.dam.2014.05.049.