Add to ORKGWe consider the routing number of trees, denoted by r£(), with respect to the matching routing model. For an arbitrary n-node tree T, it is known that rt(T) < 3n/2 + O(logn). In this paper, by providing a recursive off-line permutation routing algorithm, we show that the routing number of an n-node complete d-ary tree of height h(T)> 1 is bounded from above by n + o{n). This is near optimal since, for an n-node complete d-ary tree T of height h(T)> 1 it holds that rt(T)> n
In this paper, we consider random communication requirements and several cost measures for a par...
Abstract. The current paper considers the routing problem in dynamic trees un-der the fixed-port mod...
AbstractOblivious permutation routing in binary d-cubes has been well studied in the literature. In ...
AbstractIn this paper we examine on-line heap construction and on-line permutation routing on trees ...
Abstract. We examine on-line heap construction and on-line permutation routing on trees under the ma...
AbstractIn this paper we present an extensive study of many-to-many routing on trees under the match...
AbstractIn this paper we examine on-line heap construction and on-line permutation routing on trees ...
. In this paper we present an extensive study of dynamic routing on trees under the "matching w...
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation o...
AbstractIn this paper we present an extensive study of many-to-many routing on trees under the match...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
In this paper we study the packet routing problem under the matching model proposed by Alon, Chung a...
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so ...
In this paper we present some new complexity results on the routing time of a graph under the routin...
In this paper, we consider random communication requirements and several cost measures for a par...
Abstract. The current paper considers the routing problem in dynamic trees un-der the fixed-port mod...
AbstractOblivious permutation routing in binary d-cubes has been well studied in the literature. In ...
AbstractIn this paper we examine on-line heap construction and on-line permutation routing on trees ...
Abstract. We examine on-line heap construction and on-line permutation routing on trees under the ma...
AbstractIn this paper we present an extensive study of many-to-many routing on trees under the match...
AbstractIn this paper we examine on-line heap construction and on-line permutation routing on trees ...
. In this paper we present an extensive study of dynamic routing on trees under the "matching w...
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation o...
AbstractIn this paper we present an extensive study of many-to-many routing on trees under the match...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
In this paper we study the packet routing problem under the matching model proposed by Alon, Chung a...
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so ...
In this paper we present some new complexity results on the routing time of a graph under the routin...
In this paper, we consider random communication requirements and several cost measures for a par...
Abstract. The current paper considers the routing problem in dynamic trees un-der the fixed-port mod...
AbstractOblivious permutation routing in binary d-cubes has been well studied in the literature. In ...