Results 1  10
of
34
An algorithm using lengthr paths to approximate subgraph isomorphism
 PATTERN
, 2003
"... The ‘LeRP’ algorithm approximates subgraph isomorphism for attributed graphs based on counts of LengthR Paths. The algorithm provides a good approximation to the maximal isomorphic subgraph. The basic approach of the LeRP algorithm differs fundamentally from other methods. When comparing structura ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
The ‘LeRP’ algorithm approximates subgraph isomorphism for attributed graphs based on counts of LengthR Paths. The algorithm provides a good approximation to the maximal isomorphic subgraph. The basic approach of the LeRP algorithm differs fundamentally from other methods. When comparing
Diameter and Treewidth in MinorClosed Graph Families
, 1999
"... It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show that treewidth is bounded by a function of the diameter in a ..."
Abstract

Cited by 111 (2 self)
 Add to MetaCart
minorclosed family, if and only if some apex graph does not belong to the family. In particular, the O(D) bound above can be extended to boundedgenus graphs. As a consequence, we extend several approximation algorithms and exact subgraph isomorphism algorithms from planar graphs to other graph
ClosureTree: An Index Structure for Graph Queries
, 2006
"... 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. We introduce the concept of a graph closure, a generalized graph that represents a number of graphs. Our indexing techniq ..."
Abstract

Cited by 92 (1 self)
 Add to MetaCart
graphs that are similar to a query graph. For subgraph queries, we propose a technique called pseudo subgraph isomorphism which approximates subgraph isomorphism with high accuracy. For similarity queries, we measure graph similarity through edit distance using heuristic graph mapping methods. We
Approximately Counting Embeddings into Random Graphs
, 806
"... Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous results cover only a few specific instances of this general problem, for example, the case when H has degree at most one (mo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(monomerdimer problem). In this paper, we present the first general subcase of the subgraph isomorphism counting problem which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labeling of the vertices such that every
Graph homomorphism revisited for graph matching
 PVLDB
"... In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing the structural similarity in these applicatio ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing the structural similarity
Distance Patterns in Structural Similarity
, 2006
"... Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if both graphs are of equal size and by subisomorphisms if one graph has fewer vertices than the other. Best fit isomorphisms ..."
Abstract
 Add to MetaCart
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if both graphs are of equal size and by subisomorphisms if one graph has fewer vertices than the other. Best fit isomorphisms
A Similarity Measure for Approximate Querying over RDF data
"... Approximate query answering relies on a similarity measure that evaluates the relevance, for a given query, of a set of data extracted from the underlying database. In the context of graphmodeled data, many methods (such as, subgraph isomorphism, graph edit distance, and maximum common subgraph) ha ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Approximate query answering relies on a similarity measure that evaluates the relevance, for a given query, of a set of data extracted from the underlying database. In the context of graphmodeled data, many methods (such as, subgraph isomorphism, graph edit distance, and maximum common subgraph
LeRP: An Algorithm Using LengthR Paths To Determine Subgraph Isomorphism
 Pattern Rec Journal
, 2001
"... The LeRP algorithm determines subgraph isomorphism for attributed graphs based on counts of LengthR Paths. The algorithm provides a good approximation to the maximal isomorphic subgraph. The paradigm associated with the LeRP algorithm differs fundamentally from other approaches. When comparing str ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
The LeRP algorithm determines subgraph isomorphism for attributed graphs based on counts of LengthR Paths. The algorithm provides a good approximation to the maximal isomorphic subgraph. The paradigm associated with the LeRP algorithm differs fundamentally from other approaches. When comparing
Neighborhood based fast graph search in large networks
 in SIGMOD
, 2011
"... Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labeled network and a query graph, how to efficiently search the query graph in the target network. The presence of noise a ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
and the incomplete knowledge about the structure and content of the target network make it unrealistic to find an exact match. Rather, it is more appealing to find the topk approximate matches. In this paper, we propose a neighborhoodbased similarity measure that could avoid costly graph isomorphism and edit
Every Property of Hyperfinite Graphs is Testable
 PROCEEDINGS OF THE . 43RD ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING (STOC
, 2011
"... A kdisc around a vertex v of a graph G = (V, E) is the subgraph induced by all vertices of distance at most k from v. We show that the structure of a planar graph on n vertices, and with constant maximum degree d, is determined, up to the modification (insertion or deletion) of at most ɛdn edges, ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
is that two dbounded degree graphs that have similar frequency vectors (that is, the ℓ1 difference between the frequency vectors is small) are close to be isomorphic (where close here means that by inserting / deleting not too many edges in one of them, it becomes isomorphic to the other). We also obtain
Results 1  10
of
34