Estimating the Traffic on Weighted Cactus Networks in Linear Time

Authors:
Blaz Zmazek;Janez Zerovnik
Affiliations:
University of Maribor and IMFM;University of Maribor and IMFM
Venue:
IV '05 Proceedings of the Ninth International Conference on Information Visualisation
Year:
2005

Citing 0
Cited 3

Centdian computation for sensor networks

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Cactus graphs for genome comparisons

RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Spanning cactus of a graph: Existence, extension, optimization, and approximation

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.