Y. Noga-alon, M. Emek, M. Feldman, and . Tennenholtz, Economical graph discovery, ICS, pp.476-486, 2011.

M. Bouvel, V. Grebinski, and G. Kucherov, Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey, WG 2005, pp.16-27, 2005.
DOI : 10.1007/11604686_2
URL : https://hal.archives-ouvertes.fr/inria-00000885

B. V. Cherkassky, A. V. Goldberg, and T. Radzik, Shortest paths algorithms: Theory and experimental evaluation, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '94, pp.516-525, 1994.
DOI : 10.1007/BF02592101
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.752

H. W. Davis, R. B. Pollack, and T. Sudkamp, Towards a better understanding of bidirectioanl search, AAAI, 1984.

C. Dennis-de, Bidirectional heuristic search again, J. ACM, vol.30, issue.1, pp.22-32, 1983.

E. Stuart and . Dreyfus, An appraisal of some shortest-path algorithms, Operations Research, vol.17, issue.3, pp.395-412, 1969.

S. Ghosh and A. Mahanti, Bidirectional heuristic search with limited resources, Information Processing Letters, vol.40, issue.6, pp.335-340, 1991.
DOI : 10.1016/0020-0190(91)90203-T

E. Peter, N. J. Hart, B. Nilsson, and . Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Transactions on Systems Science and Cybernetics, pp.100-107, 1968.

A. Moffat, Empirical survey of shortest path algorithms, NZ OPER. RES, vol.11, pp.153-164, 1983.

H. Christos, M. Papadimitriou, and . Yannakakis, Shortest paths without a map, Theoretical Computer Science, vol.84, issue.1, pp.127-150, 1991.

I. Pohl, Bi-directional and Heuristics Search in Path Problems, 1969.
DOI : 10.2172/4785039

C. Sommer, Shortest-path queries in static networks, ACM Computing Surveys, vol.46, issue.4, 2014.
DOI : 10.1145/2530531

C. Szepesvári, Shortest path discovery problems: A framework, algorithms and experimental results, AAAI, pp.550-555, 2004.

D. Wagner and T. Willhalm, Speed-Up Techniques for Shortest-Path Computations, 24th International Symposium on Theoretical Aspects of Computer Science (STACS, pp.23-36, 2007.
DOI : 10.1007/978-3-540-70918-3_3