Sciweavers

1545 search results - page 1 / 309
» On tree congestion of graphs
Sort
View
DM
2010
86views more  DM 2010»
13 years 4 months ago
Minimum congestion spanning trees in planar graphs
: The main purpose of the paper is to develop an approach to the evaluation or the estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate th...
M. I. Ostrovskii
DM
2008
50views more  DM 2008»
13 years 4 months ago
On tree congestion of graphs
Stephen W. Hruska
ACID
2006
298views Algorithms» more  ACID 2006»
13 years 6 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
DAC
2003
ACM
14 years 5 months ago
Improved global routing through congestion estimation
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
Raia Hadsell, Patrick H. Madden
HPCA
2005
IEEE
14 years 5 months ago
A New Scalable and Cost-Effective Congestion Management Strategy for Lossless Multistage Interconnection Networks
In this paper, we propose a new congestion management strategy for lossless multistage interconnection networks that scales as network size and/or link bandwidth increase. Instead...
Finbar Naven, Ian Johnson, José Duato, Jose...