Sciweavers

15 search results - page 1 / 3
» On Interval Routing Schemes and Treewidth
Sort
View
WG
1995
Springer
13 years 8 months ago
On Interval Routing Schemes and Treewidth
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
Hans L. Bodlaender, Richard B. Tan, Dimitrios M. T...
SIROCCO
1998
13 years 6 months ago
Characterization results of all shortest paths interval routing schemes
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
Michele Flammini, Giorgio Gambosi, Umberto Nanni, ...
SIROCCO
2001
13 years 6 months ago
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes
An Interval Routing Scheme (IRS) is a well-known, space efficient routing strategy for routing messages in a distributed network. In this scheme, each node of the network is assig...
Yashar Ganjali
ICALP
1998
Springer
13 years 9 months ago
Static and Dynamic Low-Congested Interval Routing Schemes
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
Serafino Cicerone, Gabriele Di Stefano, Michele Fl...
WDAG
1995
Springer
84views Algorithms» more  WDAG 1995»
13 years 8 months ago
Multi-Dimensional Interval Routing Schemes
Michele Flammini, Giorgio Gambosi, Umberto Nanni, ...