3008 search results - page 367 / 602 » Independence in connected graphs |
168
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
200
click to vote
TNN
2010
15 years 1 months ago
2010
In this paper we provide theoretical and numerical analysis of a geometric activity flow network model which is aimed at explaining mathematically the scale-free functional graph s...
303
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
355
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
250
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
In this paper, we present a new framework of video object
segmentation, in which we formulate the task of extracting
prominent objects from a scene as the problem of hypergraph
...