Add to ORKGWe describe a new interconnection network called the Enhanced Butter y (EBn). It is a Cayley graph with n2n nodes, each incident with ve edges. This new network has a diameter n which compares favor-ably to the wrap-around butter y (Bn) with the same number of nodes and a diameter of b3n=2c. Bn is a subgraph of EBn. The simple and optimal routing algorithms for this network are presented.
We present a novel interconnection network topology called hybrid fat-tree. The proposed network is ...
The degree diameter problem explores the biggest graph (in terms of number of nodes) subject to some...
We build a framework within which we can define a wide range of Cayley graphs of semidirect products...
We propose a new family of interconnection networks that are Cayley graphs with constant node degree...
We develop an optimal routing algorithm as well as establish the actual value of the diameter of the...
AbstractCayley graphs of groups are presently being considered by the computer science community as ...
The cycle prefix network is a Cayley coset digraph based on sequences over an alphabet which has bee...
A new interconnection network, the Sneptree, is investigated. The Sneptree consists of 2 to the powe...
Vadapalli and Srimani [2] have proposed a new family of Cayley graph interconnection networks of co...
We generalise the biswapped network Bsw(G) to obtain a multiswapped network Msw(H;G), built around t...
We generalise the biswapped network Bsw(G)Bsw(G) to obtain a multiswapped network Msw(H;G)Msw(H;G), ...
Abstract – In this paper, we extend known relationships between Cayley (di)graphs and their subgraph...
AbstractIn this paper, we extend known relationships between Cayley digraphs and their subgraphs and...
We introduce and study a family of interconnection schemes, the Midimew networks, based on circulant...
We propose a new class of interconnection networks, called macro-star networks, which belong to the ...
We present a novel interconnection network topology called hybrid fat-tree. The proposed network is ...
The degree diameter problem explores the biggest graph (in terms of number of nodes) subject to some...
We build a framework within which we can define a wide range of Cayley graphs of semidirect products...
We propose a new family of interconnection networks that are Cayley graphs with constant node degree...
We develop an optimal routing algorithm as well as establish the actual value of the diameter of the...
AbstractCayley graphs of groups are presently being considered by the computer science community as ...
The cycle prefix network is a Cayley coset digraph based on sequences over an alphabet which has bee...
A new interconnection network, the Sneptree, is investigated. The Sneptree consists of 2 to the powe...
Vadapalli and Srimani [2] have proposed a new family of Cayley graph interconnection networks of co...
We generalise the biswapped network Bsw(G) to obtain a multiswapped network Msw(H;G), built around t...
We generalise the biswapped network Bsw(G)Bsw(G) to obtain a multiswapped network Msw(H;G)Msw(H;G), ...
Abstract – In this paper, we extend known relationships between Cayley (di)graphs and their subgraph...
AbstractIn this paper, we extend known relationships between Cayley digraphs and their subgraphs and...
We introduce and study a family of interconnection schemes, the Midimew networks, based on circulant...
We propose a new class of interconnection networks, called macro-star networks, which belong to the ...
We present a novel interconnection network topology called hybrid fat-tree. The proposed network is ...
The degree diameter problem explores the biggest graph (in terms of number of nodes) subject to some...
We build a framework within which we can define a wide range of Cayley graphs of semidirect products...