Bridging the Gap Between BFS and Indexing for Large Graphs

WormHole is a novel algorithm that bridges the gap between traversal-based and index-based graph search methods. It enables fast, scalable shortest-path queries on massive real-world networks without requiring full graph access or large preprocessing overhead. By exploiting core-periphery structures, WormHole constructs a compact sublinear index, delivers near-exact paths, and can be combined with existing methods for even faster results.