1. Highway Dimension and Provably Efficient Shortest Path Algorithms
2. SIAM ALENEX. 147–154.;Akiba Takuya
3. Jac M. Anthonisse . 1971. The Rush in a Directed Graph. Stichting Mathematisch Centrum. Mathematische Besliskunde ( 1971 ). Jac M. Anthonisse. 1971. The Rush in a Directed Graph. Stichting Mathematisch Centrum. Mathematische Besliskunde (1971).
4. Stephen P Borgatti and Martin G Everett . 2006. A graph-theoretic perspective on centrality. Social networks 28, 4 ( 2006 ), 466–484. Stephen P Borgatti and Martin G Everett. 2006. A graph-theoretic perspective on centrality. Social networks 28, 4 (2006), 466–484.
5. A faster algorithm for betweenness centrality*