Distributed Algorithms for SCC Decomposition

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00049494" target="_blank" >RIV/00216224:14330/11:00049494 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1093/logcom/exp003" target="_blank" >http://dx.doi.org/10.1093/logcom/exp003</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1093/logcom/exp003" target="_blank" >10.1093/logcom/exp003</a>

Result language
angličtina
Original language name
Distributed Algorithms for SCC Decomposition
Original language description
We study existing parallel algorithms for the decomposition of a partitioned graph into its strongly connected components (SCCs). In particular, we identify several individual procedures that the algorithms are assembled from and show how to assemble a new and more efficient algorithm, called Recursive OBF (OBFR), to solve the decomposition problem. We also report on a thorough experimental study to evaluate the new algorithm. It shows that it is possible to perform SCC decomposition in parallel efficiently and that OBFR, if properly implemented, is the best choice in most cases.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)