Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems

DOI10.1007/978-3-540-74456-6_19zbMATH Open1147.68868OpenAlexW2127842298MaRDI QIDQ3525568FDOQ3525568

Authors: Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini 

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_19

Recommendations

• Adapting parallel algorithms to the W-stream model, with applications to graph problems
• A Survey of Graph Algorithms Under Extended Streaming Models of Computation
• Automata, Languages and Programming
• On graph problems in a semi-streaming model
• Streaming Algorithms for Independent Sets

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cited In (3)

• Adapting parallel algorithms to the W-stream model, with applications to graph problems
• Computing strongly connected components in the streaming model
• A Survey of Graph Algorithms Under Extended Streaming Models of Computation

This page was built for publication: Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems

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