6598 search results - page 35 / 1320 » Graph Theory with Applications |
153
click to vote
TIT
1998
15 years 6 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
168
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
171
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
163
click to vote
COSIT
2009
Springer
16 years 1 months ago
2009
Springer
Spatial information requires models which allow us to answer ‘maybe’ to questions asking whether a location lies within a region. At the same time, models must account for data...
163
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...