Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Van Mieghem, P.
Hooghiemstra, G.
and
van der Hofstad, R.
2001.
On the efficiency of multicast.
IEEE/ACM Transactions on Networking,
Vol. 9,
Issue. 6,
p.
719.
van der Hofstad, Remco
Hooghiemstra, Gerard
and
Van Mieghem, Piet
2002.
On the covariance of the level sizes in random recursive trees.
Random Structures & Algorithms,
Vol. 20,
Issue. 4,
p.
519.
Van Mieghem, P.
and
Janic, M.
2002.
Stability of a multicast tree.
Vol. 2,
Issue. ,
p.
1099.
Braunstein, Lidia A.
Buldyrev, Sergey V.
Cohen, Reuven
Havlin, Shlomo
and
Stanley, H. Eugene
2003.
Optimal Paths in Disordered Complex Networks.
Physical Review Letters,
Vol. 91,
Issue. 16,
Buldyrev, Sergey V.
Braunstein, Lidia A.
Cohen, Reuven
Havlin, Shlomo
and
Stanley, H.Eugene
2003.
Length of optimal path in random networks with strong disorder.
Physica A: Statistical Mechanics and its Applications,
Vol. 330,
Issue. 1-2,
p.
246.
Mahmoud, Hosam M.
2004.
Random sprouts as internet models, and P�lya processes.
Acta Informatica,
Vol. 41,
Issue. 1,
p.
1.
Javanian, Mehri
and
Vahidi-asl, Mohammad Q.
2004.
Isolating the most recent entry in a random recursive tree by random cuts.
Journal of Applied Mathematics and Computing,
Vol. 16,
Issue. 1-2,
p.
115.
Braunstein, Lidia A.
Buldyrev, Sergey V.
Sreenivasan, Sameet
Cohen, Reuven
Havlin, Shlomo
and
Stanley, H. Eugene
2004.
Complex Networks.
Vol. 650,
Issue. ,
p.
127.
Mieghem, Piet Van
2004.
The hopcount to an anycast group.
International Journal of Communication Systems,
Vol. 17,
Issue. 3,
p.
269.
Van Mieghem, Piet
and
van Langen, Stijn
2005.
Influence of the link weight structure on the shortest path.
Physical Review E,
Vol. 71,
Issue. 5,
Havlin, Shlomo
Braunstein, Lidia A.
Buldyrev, Sergey V.
Cohen, Reuven
Kalisky, Tomer
Sreenivasan, Sameet
and
Eugene Stanley, H.
2005.
Optimal path in random networks with disorder: A mini review.
Physica A: Statistical Mechanics and its Applications,
Vol. 346,
Issue. 1-2,
p.
82.
Van Mieghem, Piet
and
Magdalena, Serena M.
2005.
Phase transition in the link weight structure of networks.
Physical Review E,
Vol. 72,
Issue. 5,
Flaxman, Abraham
Gamarnik, David
and
Sorkin, Gregory B.
2006.
Internet and Network Economics.
Vol. 4286,
Issue. ,
p.
99.
Wang, Huijuan
and
Van Mieghem, Piet
2007.
Constructing the Overlay Network by Tuning Link Weights.
p.
139.
Dhillon, S.S.
and
Van Mieghem, P.
2007.
Performance analysis of the AntNet algorithm.
Computer Networks,
Vol. 51,
Issue. 8,
p.
2104.
van der Hofstad, Remco
Hooghiemstra, Gerard
and
Van Mieghem, Piet
2007.
The weight of the shortest path tree.
Random Structures & Algorithms,
Vol. 30,
Issue. 3,
p.
359.
BRAUNSTEIN, LIDIA A.
WU, ZHENHUA
CHEN, YIPING
BULDYREV, SERGEY V.
KALISKY, TOMER
SREENIVASAN, SAMEET
COHEN, REUVEN
LÓPEZ, EDUARDO
HAVLIN, SHLOMO
and
STANLEY, H. EUGENE
2007.
OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS.
International Journal of Bifurcation and Chaos,
Vol. 17,
Issue. 07,
p.
2215.
Wang, Huijuan
and
Van Mieghem, Piet
2007.
Shifting the Link Weights in Networks.
p.
67.
Cohen, Reuven
and
Havlin, Shlomo
2008.
Handbook of Large-Scale Random Networks.
Vol. 18,
Issue. ,
p.
143.
Van Mieghem, P.
and
Tang, S.
2008.
WEIGHT OF THE SHORTEST PATH TO THE FIRST ENCOUNTERED PEER IN A PEER GROUP OF SIZE m.
Probability in the Engineering and Informational Sciences,
Vol. 22,
Issue. 1,
p.
37.