Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:complexity |
O(log n)
O(m+n) |
| gptkbp:designedFor |
gptkb:parallel_random-access_machine
|
| gptkbp:field |
computer science
parallel computing |
| gptkbp:input |
gptkb:graph
|
| gptkbp:namedAfter |
gptkb:Yossi_Shiloach
gptkb:Uzi_Vishkin |
| gptkbp:notable_for |
efficient parallelization
|
| gptkbp:output |
connected components
|
| gptkbp:parallel_complexity |
O(log n)
|
| gptkbp:parallel_work |
O(m+n)
|
| gptkbp:publishedIn |
1982
|
| gptkbp:solvedBy |
connected components problem
|
| gptkbp:bfsParent |
gptkb:Yossi_Shiloach
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Shiloach–Vishkin algorithm
|