+- Hack Forums (https://hackforums.net)
+-- Forum: Hacks, Exploits, and Various Discussions (https://hackforums.net/forumdisplay.php?fid=45)
+--- Forum: Grayhat • Purple Team • Hybrid Security (https://hackforums.net/forumdisplay.php?fid=449)
+---- Forum: Beginner Hacking (https://hackforums.net/forumdisplay.php?fid=4)
+---- Thread: Bridging the Gap Between BFS and Indexing for Large Graphs (/showthread.php?tid=6311260)
Bridging the Gap Between BFS and Indexing for Large Graphs - Stanley - Oct 15, 2025
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-between-bfs-and-indexing-for-large-graphs?source=rss
RE: Bridging the Gap Between BFS and Indexing for Large Graphs - Hackers - Oct 19, 2025
I think Stanley double-posted this similar topic, but here's the paper:
https://arxiv.org/abs/2406.08624
Pretty nifty. It sounds like they pre-index and compare different datasets to speed up queries when needed.
RE: Bridging the Gap Between BFS and Indexing for Large Graphs - leste - Oct 30, 2025
Balancing those was hard on large graphs.