SIGN IN
SIGN UP
Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time.
Full Text:
PDF
Buy this Article
Authors:
Petra Berenbrink
Simon Fraser University, Vancouver, BC, Canada
Colin Cooper
King's College London, London, United Kingdom
Tom Friedetzky
Durham University, Durham, United Kingdom
Published in:
· Proceeding
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Pages 29-36
ACM
New York, NY
, USA
©2012
table of contents
ISBN: 978-1-4503-1450-3
doi>
10.1145/2332432.2332438
2012 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 80
· Downloads (cumulative): 80
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
distributed networks
general
network search
network topology
random walk
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder