CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishGiven a weighted graph G(VG, EG) 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).
| Titolo: | Brief Announcement: Distributed Swap Edges computation for Minimum Cost Spanning Trees | |
| Autori interni: | ||
| Anno del prodotto: | 2009 | |
| Rivista: | ||
| Abstract: | Given a weighted graph G(VG, EG) 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). | |
| Handle: | http://hdl.handle.net/11568/128614 | |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
http://hdl.handle.net/11568/128614
Copyright © 2022