Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:application |
minimum spanning tree
network design |
| gptkbp:complexity |
O(n log n) messages
|
| gptkbp:field |
computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Awerbuch's algorithm
|
| gptkbp:namedAfter |
gptkb:Baruch_Awerbuch
|
| gptkbp:property |
asynchronous
distributed message-efficient |
| gptkbp:solvedBy |
minimum spanning tree problem
|
| gptkbp:usedIn |
distributed systems
network protocols |
| gptkbp:yearProposed |
1987
|
| gptkbp:bfsParent |
gptkb:Baruch_Awerbuch
|
| gptkbp:bfsLayer |
5
|