A distributed algorithm for constructing a minimum diameter spanning tree (Q1881298): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977502354 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1312.1961 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:35, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A distributed algorithm for constructing a minimum diameter spanning tree |
scientific article |
Statements
A distributed algorithm for constructing a minimum diameter spanning tree (English)
0 references
4 October 2004
0 references
spanning trees
0 references
minimum diameter spanning trees
0 references
shortest paths
0 references
shortest paths trees
0 references
all-pairs shortest paths
0 references
absolute centres
0 references
