909 search results - page 6 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
STOC
1993
ACM
13 years 11 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
SEMWEB
2009
Springer
13 years 12 months ago
2009
Springer
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
ICAIL
2003
ACM
14 years 19 days ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
PVLDB
2010
13 years 5 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...