Computing strongly connected components in the streaming model

DOI10.1007/978-3-642-19754-3_20MaRDI QIDQ2999346zbMATH OpenOpenAlexFDO

Authors Luigi Laura, Federico Santaroni

Publication date 12 May 2011

Published in Theory and Practice of Algorithms in (Computer) Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19754-3_20

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• I/O- and CPU-optimal recognition of strongly connected components
• Automata, Languages and Programming
• An efficient strongly connected components algorithm in the fault tolerant model
• An efficient strongly connected components algorithm in the fault tolerant model
• Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems

Cited in

(2)

• Low-memory algorithms for online edge coloring
• New algorithms and lower bounds for streaming tournaments

Describes a project that uses

Uses Software

• UbiCrawler

This page was built for publication: Computing strongly connected components in the streaming model

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