How WormHole Speeds Up Pathfinding in Billion-Edge Graphs

WormHole is a novel algorithm designed for answering multiple shortest path queries efficiently across large-scale social and information networks. It offers sublinear query complexity, rapid setup (up to 100x faster than PLL and MLL), and strong accuracy guarantees. By storing exact paths on a small “core” subset of vertices, WormHole achieves both theoretical soundness and exceptional empirical performance—even on billion-edge graphs—making it a breakthrough in scalable network analysis.