Sciweavers

6 search results - page 1 / 2
» Sampling networks by the union of m shortest path trees
Sort
View
CN
2010
58views more  CN 2010»
13 years 6 months ago
Sampling networks by the union of m shortest path trees
Huijuan Wang, Piet Van Mieghem
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 2 days ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
ICC
2007
IEEE
140views Communications» more  ICC 2007»
14 years 9 days ago
Performance Analysis for Overlay Multicast on Tree and M-D Mesh Topologies
— Without the multicast support from the underlying networks, overlay multicast has the advantage of implementing inter-domain multicast communications. Usually, overlay multicas...
Wanqing Tu
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 5 months ago
Exploring networks with traceroute-like probes: theory and simulations
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain ...
BMCBI
2008
96views more  BMCBI 2008»
13 years 6 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown