4744 search results - page 29 / 949 » Connected Computing |
APNOMS
2006
Springer
14 years 6 days ago
2006
Springer
Specifically ubiquitous computing paradigm is based on seamless connectivity. And also to guarantee the seamless connectivity, an intelligent network management between heterogeneo...
TAMC
2009
Springer
14 years 3 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
ICDCS
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...