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). © 2009 Springer-Verlag.
CITATION STYLE
Pagli, L., & Prencipe, G. (2009). Brief annoucement: Distributed swap edges computation for minimum routing cost spanning trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5923 LNCS, pp. 365–371). https://doi.org/10.1007/978-3-642-10877-8_29
Mendeley helps you to discover research relevant for your work.