1545 search results - page 2 / 309 » On tree congestion of graphs |
COR
2004
13 years 5 months ago
2004
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
SPAA
2004
ACM
13 years 10 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
HIPEAC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Designers of large parallel computers and clusters are becoming increasingly concerned with the cost and power consumption of the interconnection network. A simple way to...
GLVLSI
2003
IEEE
13 years 10 months ago
2003
IEEE
In dense integrated circuit designs, management of routing congestion is essential; an over congested design may be unroutable. Many factors influence congestion: placement, rout...
ECCC
2006
13 years 5 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...