743 search results - page 84 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
146
Voted
TCC
2012
Springer
13 years 9 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
117
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
112
click to vote
PKDD
2010
Springer
15 years 17 days ago
2010
Springer
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
106
Voted
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
121
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...