Efficient processing of distance queries in large graphs: a vertex cover approach
Breadth-first crawling yields high-quality pages