Sciweavers

632 search results - page 33 / 127
» On Routing in Circulant Graphs
Sort
View
CJ
1998
56views more  CJ 1998»
13 years 9 months ago
The Complexity of Interval Routing on Random Graphs
Michele Flammini, Jan van Leeuwen, Alberto Marchet...
NETWORKS
2002
13 years 9 months ago
Light graphs with small routing cost
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
ICDCS
2010
IEEE
13 years 10 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
IEEECIT
2010
IEEE
13 years 8 months ago
Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the
Abstract—In this paper, we propose efficient routing algorithms for collective communication in a newly proposed, versatile network, called a recursive dual-net (RDN). The RDN c...
Yamin Li, Shietung Peng, Wanming Chu