Publication details
Parallel Algorithms for Finding SCCs in Implicitly Given Graphs
| Basic information | |
|---|---|
| Original title: | Parallel Algorithms for Finding SCCs in Implicitly Given Graphs |
| Authors: | Jiří Barnat, Pavel Moravec |
| Further information | |
|---|---|
| Citation: | BARNAT, Jiří  - MORAVEC, Pavel. Parallel Algorithms for Finding SCCs in Implicitly Given Graphs. In Formal Methods: Applications and Technology. Berlin, Heidelberg : Springer-Verlag, 2007. ISBN 978-3-540-70951-0, pp. 316-330. 2006, Bonn, Germany. |
| Original language: | English |
| Field: | Informatika |
| Type: | Article in Proceedings |
| Keywords: | distributed verification; SCCs |
We examine existing parallel algorithms for detection of strongly connected components and discuss their applicability to the case when the graph to be decomposed is given implicitly. In particular, we list individual techniques that parallel algorithms for SCC detection are assembled from and show how to assemble a new more efficient algorithm for solving the problem. In the paper we also report on a preliminary experimental study we did to evaluate the new algorithm.
Related projects:
- Integrated approach to education of PhD students in the area of parallel and distributed systems
- Techniques for automatic verification and validation of software nad hardware systems
- Institute for Theoretical Computer Science
- Highly Parallel and Distributed Computing Systems
- Automated software verification
