Efficient distributed source detection with limited bandwidth
Authors:
Open Access
- 22 July 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 375-382
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Additive spanners and (α, β)-spannersACM Transactions on Algorithms, 2010
- Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental EvaluationJournal of Computers, 2007
- Approximate distance oracles for unweighted graphs in expected O ( n 2 ) timeACM Transactions on Algorithms, 2006
- Computing almost shortest pathsACM Transactions on Algorithms, 2005
- Approximate distance oraclesJournal of the ACM, 2005
- Compact and localized distributed data structuresDistributed Computing, 2003
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)SIAM Journal on Computing, 1999
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2MessagesJournal of Algorithms, 1997
- A fast distributed shortest path algorithm for a class of hierarchically clustered data networksIEEE Transactions on Computers, 1992
- Distributed network protocolsIEEE Transactions on Information Theory, 1983