1545 search results - page 5 / 309 » On tree congestion of graphs |
SIGMETRICS
2003
ACM
15 years 2 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
GD
2005
Springer
15 years 3 months ago
2005
Springer
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...
CCR
2004
14 years 9 months ago
2004
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...