I. Abraham and C. Gavoille, Object location using path separators, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.188-197, 2006.
DOI : 10.1145/1146381.1146411
URL : https://hal.archives-ouvertes.fr/hal-00400425

É. Diot and C. Gavoille, Path Separability of Graphs, Lecture Notes in Computer Science, vol.6213, pp.262-273, 2010.
DOI : 10.1007/978-3-642-14553-7_25
URL : https://hal.archives-ouvertes.fr/hal-00984598

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability -A Guide to the Theory of NP- Completeness, 1979.

J. Kleinberg, Complex networks and decentralized search algorithms, International Congress of Mathematicians (ICM), 2006.
DOI : 10.4171/022-3/50
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.410

M. Thorup, Compact oracles for reachability and approximate distances in planar digraphs, Journal of the ACM, vol.51, issue.6, pp.993-1024, 2004.
DOI : 10.1145/1039488.1039493