554 search results - page 17 / 111 » Power Domination Problem in Graphs |
94
Voted
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
125
click to vote
SIAMCOMP
2002
15 years 2 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
113
click to vote
AAAI
2010
15 years 4 months ago
2010
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
114
click to vote
IPPS
2002
IEEE
15 years 7 months ago
2002
IEEE
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
110
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at m...