Skip Navigation
InitialsDiceBearhttps://github.com/dicebear/dicebearhttps://creativecommons.org/publicdomain/zero/1.0/„Initials” (https://github.com/dicebear/dicebear) by „DiceBear”, licensed under „CC0 1.0” (https://creativecommons.org/publicdomain/zero/1.0/)TP
Posts
1
Comments
2
Joined
2 yr. ago
Computer Science @lemmy.ml
tb4p @lemmy.ml
arxiv.org Sublinear Time Shortest Path in Expander Graphs

Computing a shortest path between two nodes in an undirected unweighted graph is among the most basic algorithmic tasks. Breadth first search solves this problem in linear time, which is clearly also a lower bound in the worst case. However, several works have shown how to solve this problem in subl...

Sublinear Time Shortest Path in Expander Graphs