478 search results - page 1 / 96 » Diameter and Center Computations in Networks |
67
Voted
COLOGNETWENTE
2009
14 years 12 months ago
2009
CCR
2010
14 years 8 months ago
2010
Data centers have a crucial role in current Internet architecture supporting content-centric networking. State-of-theart data centers have different architectures like fat-tree [1...
CONEXT
2009
ACM
14 years 12 months ago
2009
ACM
Shipping-container-based data centers have been introduced as building blocks for constructing mega-data centers. However, it is a challenge on how to interconnect those container...
IWCIA
2004
Springer
15 years 4 months ago
2004
Springer
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
107
click to vote
SAC
2003
ACM
15 years 4 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...