Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 160-172
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Small stretch-spanners in the streaming modelTheoretical Computer Science, 2009
- Fault-tolerant spanners for general graphs2009
- Graph Spanners in the Streaming Model: An Experimental StudyAlgorithmica, 2008
- Streaming algorithm for graph spanners—single pass and constant processing time per edgeInformation Processing Letters, 2008
- Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse SpannersLecture Notes in Computer Science, 2007
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphsRandom Structures & Algorithms, 2006
- Dynamic Algorithms for Graph Spanners2006
- Small Stretch Spanners on Dynamic GraphsJournal of Graph Algorithms and Applications, 2006
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch tSIAM Journal on Computing, 1998
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980