1. Ittai, A., Shiri, C., Daniel, D., Goldberg, A. V., & Werneck, R. F. (2016). On dynamic approximate shortest paths for planar graphs with worst case costs. In SODA 16 Proceddings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia: SIAM.
2. Cheng Nan, L. (April 2016). On the construction of all shortest node-disjoint paths in star networks. Elsevier Information Processing Letters, 116(4), 299–303.
3. Dorogovtsev, S. N. (2003). Real networks. In Evolution of networks from biological nets to the internet and WWW (pp. 31–73). Oxford, UK: Oxford University Press.
4. Newman, M. E., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113.
5. Newman, M. E. J. (2001). Scientific collaboration networks. II. Shortest paths, weighted networks and centrality. Physical Review E, 64, 016132-1–016132-7.