Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
1204.1939
Cited By
v1
v2
v3 (latest)
Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2012
9 April 2012
Petra Berenbrink
C. Cooper
T. Friedetzky
OT
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time"
1 / 1 papers shown
Title
Tree exploration in dual-memory model
International Symposium on Mathematical Foundations of Computer Science (MFCS), 2021
Dominik Bojko
Karol Gotfryd
Dariusz R. Kowalski
Dominik Pajak
48
1
0
26 Dec 2021
1
