Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

IJBC
2007

favoriteEmaildiscussreport

39views more IJBC 2007»

Optimal Path and Minimal Spanning Trees in Random Weighted Networks

14 years 10 months ago

Optimal Path and Minimal Spanning Trees in Random Weighted Networks

Download argento.bu.edu

Lidia A. Braunstein, Zhenhua Wu, Yiping Chen, Serg

Real-time Traffic

IJBC 2007 |

claim paper

Related Content

» Stable routing under the Spanning Tree Protocol

» Congestion Games Optimization in Competition

» Modeling and solving the rooted distanceconstrained minimum spanning tree problem

» A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees

» 2Medians in trees with posneg weights

» Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem

» Weighted random oblivious routing on torus networks

» An Optimal Rebuilding Strategy for an Incremental Tree Problem

» Dynamical Construction of a CoreBased GroupShared Multicast Tree in Mobile Ad Hoc Networks

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2007
Where	IJBC
Authors	Lidia A. Braunstein, Zhenhua Wu, Yiping Chen, Sergey V. Buldyrev, Tomer Kalisky, Sameet Sreenivasan, Reuven Cohen, Eduardo López, Shlomo Havlin, H. Eugene Stanley

Comments (0)