All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Distributed Algorithms for SCC Decomposition

The result's identifiers

  • 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>

Alternative languages

  • 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

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • 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)

Others

  • Publication year

    2011

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Journal of Logic and Computation

  • ISSN

    0955-792X

  • e-ISSN

  • Volume of the periodical

    21

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    22

  • Pages from-to

    23-44

  • UT code for WoS article

    000286911500003

  • EID of the result in the Scopus database