646 search results - page 36 / 130 » Generalized connected domination in graphs |
ICC
2009
IEEE
14 years 3 months ago
2009
IEEE
—Repairing connectivity and achieving a certain level of fault tolerance are two important research challenges in wireless sensor networks that have, in many papers in the litera...
HICSS
2002
IEEE
14 years 1 months ago
2002
IEEE
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
AAIM
2005
Springer
14 years 2 months ago
2005
Springer
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...
DAM
2010
13 years 8 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...