47 search results - page 3 / 10 » Approximate Constrained Subgraph Matching |
SODA
1992
ACM
13 years 9 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
WG
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
CONTEXT
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this paper, we propose a general model of schema matching based on the following ideas: on the one hand, a schema is viewed as a context (namely as a partial and appro...
ICALP
2011
Springer
12 years 12 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...