721 search results - page 39 / 145 » Bounds on the k-domination number of a graph |
115
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
134
click to vote
ISAAC
2010
Springer
14 years 12 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
109
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
123
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
147
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...