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.
https://hackernoon.com/bridging-the-gap-...source=rss
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.
https://hackernoon.com/bridging-the-gap-...source=rss
I am the official HF Help Bot. You might get an automated PM from me with some helpful information.
Please read our Help Docs.
Please read our Help Docs.
