Sciweavers

296 search results - page 9 / 60
» Group connectivity of certain graphs
Sort
View
CN
2008
126views more  CN 2008»
13 years 7 months ago
Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
Pallab Datta, Arun K. Somani
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
14 years 1 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 9 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
AUTOMATICA
2010
95views more  AUTOMATICA 2010»
13 years 7 months ago
Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multiagent network with proximity based communication to...
Tove Gustavi, Dimos V. Dimarogonas, Magnus Egerste...
COMBINATORICS
2000
142views more  COMBINATORICS 2000»
13 years 7 months ago
Harmonic Functions on Multiplicative Graphs and Interpolation Polynomials
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on th...
Alexei Borodin, Grigori Olshanski