Radio cover time in hyper-graphs
Authors:
- 1 January 2014
- journal article
- Published by Elsevier in Ad Hoc Networks
- Vol. 12, 278-290
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Probabilistic quorum systems in wireless ad hoc networks2008
- On the cover time and mixing time of random geometric graphsTheoretical Computer Science, 2007
- Random walks in peer-to-peer networks2004
- Efficient and robust query processing in dynamic environments using random walk techniques2004
- Gossip-based computation of aggregate information2004
- The electrical resistance of a graph captures its commute and cover times1989
- Bounds on the cover timeJournal of Theoretical Probability, 1989
- Lower bounds for covering times for reversible Markov chains and random walks on graphsJournal of Theoretical Probability, 1989
- Generating random spanning trees1989
- Random walks, universal traversal sequences, and the complexity of maze problems1979