Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Approximate Graph Matching"”.
-
Improving the output of algorithms for large-scale approximate graph matching
In approximate graph matching, the goal is to find the best correspondence between the labels of two correlated graphs. Recently, the problem has been applied to social network de-anonymization, and several efficient algorithms have been proposed for approximate graph matching in that domain. These …
-
On Ranked Approximate Matching Of Large Attributed Graphs
… database applications entail sophisticated graph based query manipulation, predominantly evident in large-scale</p> <p>scientific applications. To access the information embedded in</p> <p>graphs, efficient graph matching tools and algorithms have become of prime importance. Although the …