The WormHole Algorithm for Approximate Shortest Paths in Large Graphs Post date October 15, 2025 Post author By Hausdorff Post categories In bfs-vs-indexing, core-periphery-networks, graph-algorithms, large-scale-graphs, network-analysis, scalable-graph-mining, shortest-path-computation, wormhole-algorithm
Bridging the Gap Between BFS and Indexing for Large Graphs Post date October 15, 2025 Post author By Hausdorff Post categories In bfs-vs-indexing, core-periphery-networks, graph-algorithms, large-scale-graphs, network-analysis, scalable-graph-mining, shortest-path-computation, wormhole-algorithm
Sciencx
Sciencx