599 search results - page 57 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
96
Voted
WALCOM
2010
IEEE
15 years 9 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
205
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
138
Voted
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
139
Voted
CSCLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
129
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...