An optimal parallel algorithm for computing furthest neighbors in a tree (Q1205722)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal parallel algorithm for computing furthest neighbors in a tree |
scientific article; zbMATH DE number 148038
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal parallel algorithm for computing furthest neighbors in a tree |
scientific article; zbMATH DE number 148038 |
Statements
An optimal parallel algorithm for computing furthest neighbors in a tree (English)
0 references
1 April 1993
0 references
EREW PRAM
0 references
furthest neighbor
0 references
diameter of a tree
0 references
