Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively
IEICE - Transactions on Information and Systems
The Swap Edges of a Multiple-Sources Routing Tree
Algorithmica
The zoo of tree spanner problems
Discrete Applied Mathematics
| Hi-index | 0.00 |
Given a weighted graph G (V G , E G ) representing a communication network, with n nodes and m edges where the weights are positive integers, its Spanning Tree is typically used to route messages. In [1] the routing cost of a spanning tree is defined as the sum of the distances over all pairs of vertices of this tree. Hence, the most suitable spanning tree for the routing problem is the one minimizing the routing cost: the Minimum Routing Cost Spanning Tree (MRCST).