Streaming algorithm for graph spanners—single pass and constant processing time per edge
Author:
- 30 April 2008
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 106 (3) , 110-114
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphsRandom Structures & Algorithms, 2006
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- Graph spannersJournal of Graph Theory, 1989
- Complexity of network synchronizationJournal of the ACM, 1985