Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0166-218x(03)00262-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991032379 / rank | |||
Normal rank | |||
Latest revision as of 08:36, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-source spanning trees: Algorithms for minimizing source eccentricities. |
scientific article |
Statements
Multi-source spanning trees: Algorithms for minimizing source eccentricities. (English)
0 references
14 March 2004
0 references
Network
0 references
Communications
0 references
Multicast
0 references
Graph
0 references
Shortest-paths spanning trees
0 references
Algorithm
0 references
