721 search results - page 35 / 145 » Bounds on the k-domination number of a graph |
104
click to vote
DM
2008
15 years 2 months ago
2008
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...
140
click to vote
TIT
2010
14 years 8 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
140
click to vote
COMBINATORICS
1998
15 years 1 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
137
click to vote
INFOCOM
2012
IEEE
13 years 4 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...
116
click to vote
PVLDB
2010
15 years 10 days ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...