47 search results - page 1 / 10 » Approximate Constrained Subgraph Matching |
CP
2005
Springer
13 years 10 months ago
2005
Springer
CSCLP
2007
Springer
13 years 10 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...
PVLDB
2010
13 years 3 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
ICPR
2004
IEEE
14 years 5 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
ASUNAM
2011
IEEE
12 years 4 months ago
2011
IEEE
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...