Distributing Storage in Cloud Environments
(2013)
Presentation / Conference Contribution
Outputs (2)
Random walks which prefer unvisited edges : exploring high girth even degree expanders in linear time (2013)
Journal Article
Berenbrink, P., Cooper, C., & Friedetzky, T. (2015). Random walks which prefer unvisited edges : exploring high girth even degree expanders in linear time. Random Structures and Algorithms, 46(1), 36-54. https://doi.org/10.1002/rsa.20504Let G = (V,E) be a connected graph with |V | = n vertices. A simple random walk on the vertex set of G is a process, which at each step moves from its current vertex position to a neighbouring vertex chosen uniformly at random. We consider a modified... Read More about Random walks which prefer unvisited edges : exploring high girth even degree expanders in linear time.