Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201)
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: Multi-source spanning trees: Algorithms for minimizing source eccentricities. |
scientific article; zbMATH DE number 2055522
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-source spanning trees: Algorithms for minimizing source eccentricities. |
scientific article; zbMATH DE number 2055522 |
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
0 references
0.91571033
0 references
0.88312304
0 references
0.8725472
0 references
0.8715197
0 references
0.86674875
0 references
0 references
