Pages that link to "Item:Q1572753"
From MaRDI portal
The following pages link to On the cover time of planar graphs (Q1572753):
Displaying 11 items.
- Cover times, blanket times, and majorizing measures (Q431644) (← links)
- Static and expanding grid coverage with ant robots: complexity results (Q638536) (← links)
- An upper bound on the cover time for powers of graphs (Q1579561) (← links)
- How fast planar maps get swallowed by a peeling process (Q1748570) (← links)
- Exponential concentration of cover times (Q1748936) (← links)
- Cover times for sequences of reversible Markov chains on random graphs (Q2258610) (← links)
- On the cover time and mixing time of random geometric graphs (Q2373731) (← links)
- TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks (Q2913793) (← links)
- The Cover Time of Cartesian Product Graphs (Q3000524) (← links)
- UNIFORM SPANNING FORESTS OF PLANAR GRAPHS (Q5194701) (← links)
- Many Random Walks Are Faster Than One (Q5199503) (← links)