loading...
Estimating the Traffic on Weighted Cactus Networks in Linear Time
London, England July 06-July 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IV.2005.48Ninth International Conference on Inf ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Blaž Zmazek, Janez Žerovnik, "Estimating the Traffic on Weighted Cactus Networks in Linear Time," Information Visualisation, International Conference on, pp. 536-541, Ninth International Conference on Information Visualisation (IV'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/IV.2005.48,
author = {Blaž Zmazek and Janez Žerovnik},
title = {Estimating the Traffic on Weighted Cactus Networks in Linear Time},
journal ={Information Visualisation, International Conference on},
volume = {0},
year = {2005},
issn = {1550-6037},
pages = {536-541},
doi = {http://doi.ieeecomputersociety.org/10.1109/IV.2005.48},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Information Visualisation, International Conference on
TI - Estimating the Traffic on Weighted Cactus Networks in Linear Time
SN - 1550-6037
SP536
EP541
A1 - Blaž Zmazek,
A1 - Janez Žerovnik,
PY - 2005
KW - null
VL - 0
JA - Information Visualisation, International Conference on
ER -
 
Blaž Zmazek, University of Maribor and IMFM
Janez Žerovnik, University of Maribor and IMFM
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.