Finding strongly connected components in distributed graphs (Q2484293)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2189305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding strongly connected components in distributed graphs |
scientific article; zbMATH DE number 2189305 |
Statements
Finding strongly connected components in distributed graphs (English)
0 references
1 August 2005
0 references
Strongly connected components
0 references
Graph algorithm
0 references
Parallel computing
0 references
0.8059325814247131
0 references
0.7971802353858948
0 references
