Ninth International Conference on Information Visualisation (IV'05) Estimating the Traffic on Weighted Cactus Networks in Linear Time London, England July 06-July 08 ISBN: 0-7695-2397-8
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IV.2005.48
A communication network can be modeled by a graph with weighted vertices and edges corresponding to the amount of traffic from sources and expected delays at links. We give a linear algorithm for computing the sum of all delays on a weighted cactus graphs. Cactus is a graph in which every edge lies on at most one cycle. The sum of delays is equivalent to the weighted Wiener number, a well known graph invariant in mathematical chemistry. Complexity of computing Wiener polynomial on cacti is discussed.
Citation:
Blaž Zmazek, Janez Žerovnik, "Estimating the Traffic on Weighted Cactus Networks in Linear Time," iv, pp.536-541, Ninth International Conference on Information Visualisation (IV'05), 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||