Computing graph spanners in small memory: fault-tolerance and streaming

DOI10.1007/978-3-642-14031-0_19MaRDI QIDQ3578313zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Giuseppe F. Italiano, Andrea Ribichini, Giorgio Ausiello, Paolo G. Franciosa

Publication date 20 July 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14031-0_19

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing graph spanners in small memory: fault-tolerance and streaming
• Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
• Small stretch ( , )-spanners in the streaming model
• Fault-tolerant spanners for general graphs
• Fault tolerant spanners for general graphs

Cited in

(4)

• Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
• Space lower bounds for graph stream problems
• Graph spanners in the streaming model: An experimental study
• Computing graph spanners in small memory: fault-tolerance and streaming

This page was built for publication: Computing graph spanners in small memory: fault-tolerance and streaming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578313)