A simple parallel algorithm for computing the diameters of all vertices in a tree and its application (Q1198069)
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: A simple parallel algorithm for computing the diameters of all vertices in a tree and its application |
scientific article; zbMATH DE number 92124
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple parallel algorithm for computing the diameters of all vertices in a tree and its application |
scientific article; zbMATH DE number 92124 |
Statements
A simple parallel algorithm for computing the diameters of all vertices in a tree and its application (English)
0 references
16 January 1993
0 references
computational complexity
0 references
parallel algorithms
0 references
maximal tree cover problem
0 references
tree
0 references
distances
0 references
0 references
0.8942045
0 references
0.89137274
0 references
0.88752985
0 references
0 references
0.8838347
0 references
