1. Acar, U.A., Blelloch, G.E., Tangwongsan, K., 2007. Non-oblivious retroactive data structures. Technical Report CMU-CS-07-169.
2. An algorithm for the organization of information;Adelson-Velskii;Soviet Math. Doklady.,1962
3. Bergamini, E., Meyerhenke, H., 2015. Fully-dynamic approximation of betweenness centrality. In the proceedings of European Symposium on Algorithms pp. 155–166.
4. Bergamini, E., Meyerhenke, H., Staudt, C., 2015. Approximating betweenness centrality in large evolving networks. In: Proceedings of the Meeting on Algorithm Engineering & Expermiments pp. 133–146.
5. Maintaining shortest paths under deletions in weighted directed graphs;Bernstein;STOC,2013