Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time (2013)

First Author: Berenbrink P

Attributed to: Randomized Algorithms for Computer Networks funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1002/rsa.20504

Publication URI: http://dx.doi.org/10.1002/rsa.20504

Type: Journal Article/Review

Parent Publication: Random Structures & Algorithms

Issue: 1