"Parallel Algorithms for Finding SCCs in Implicitly Given Graphs"@en . . "Paraleln\u00ED algoritmy pro hled\u00E1n\u00ED siln\u011B souvisl\u00FDch komponent v implicitn\u011B zadan\u00FDch grafech"@cs . "4346" . "RIV/00216224:14330/07:00019374" . . "distributed verification; SCCs"@en . . . . "[D7246C31E29D]" . "Barnat, Ji\u0159\u00ED" . "P(1ET408050503), P(1M0545), P(GA201/06/1338), P(GD102/05/H050), Z(MSM0021622419)" . . . . "Moravec, Pavel" . . "Paraleln\u00ED algoritmy pro hled\u00E1n\u00ED siln\u011B souvisl\u00FDch komponent v implicitn\u011B zadan\u00FDch grafech"@cs . . . "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."@en . . "14330" . "2007" . . . "\u010Cl\u00E1nek zkoum\u00E1 existuj\u00EDc\u00ED algoritmy for detekci siln\u011B souvisl\u00FDch komponent a diskutuje jejich pou\u017Eitelnost v p\u0159\u00EDpad\u011B, \u017Ee je vstupn\u00ED graf zad\u00E1n implicitn\u011B. Zejm\u00E9na jsou pops\u00E1ny techniky kter\u00E9 tyto algoritmy pou\u017E\u00EDvaj\u00ED. Je tak\u00E9 prezentov\u00E1n nov\u00FD efektivn\u011Bj\u0161\u00ED algoritmus vyu\u017E\u00EDvaj\u00EDc\u00ED tyto techniky. V \u010Dl\u00E1nku jsou tak\u00E9 pops\u00E1ny p\u0159edb\u011B\u017En\u00E9 v\u00FDsledky experiment\u00E1ln\u00EDho porovn\u00E1n\u00ED d\u0159\u00EDv\u011Bj\u0161\u00EDch algoritm\u016F i nov\u00E9ho."@cs . "0302-9743" . . "Parallel Algorithms for Finding SCCs in Implicitly Given Graphs" . "15"^^ . . "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." . "440574" . "LNCS" . "RIV/00216224:14330/07:00019374!RIV08-AV0-14330___" . "Parallel Algorithms for Finding SCCs in Implicitly Given Graphs" . . "2"^^ . . . "2"^^ . "316-330" . . "Parallel Algorithms for Finding SCCs in Implicitly Given Graphs"@en . "DE - Spolkov\u00E1 republika N\u011Bmecko" .