Sciweavers

3192 search results - page 445 / 639
» The minimum latency problem
Sort
View
COR
2004
111views more  COR 2004»
15 years 3 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
DM
1999
145views more  DM 1999»
15 years 3 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
15 years 2 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou
INFORMATICALT
2011
170views more  INFORMATICALT 2011»
14 years 11 months ago
Community Detection Through Optimal Density Contrast of Adjacency Matrix
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...
Tianzhu Liang, Kwok Yip Szeto
JSAC
2010
120views more  JSAC 2010»
14 years 10 months ago
Simple movement control algorithm for bi-connectivity in robotic sensor networks
Robotic sensor networks are more powerful than sensor networks because the sensors can be moved by the robots to adjust their sensing coverage. In robotic sensor networks, an impor...
Hai Liu, Xiaowen Chu, Yiu-Wing Leung, Rui Du