249 search results - page 35 / 50 » The upper bound on k-tuple domination numbers of graphs |
GD
2008
Springer
13 years 9 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
WG
2009
Springer
14 years 3 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
MOBICOM
2006
ACM
14 years 2 months ago
2006
ACM
In this paper we study the broadcast capacity of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated in the network such th...