Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
By Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu Yu. Proceedings of the VLDB Endowment, 2008
462 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Signal Processing
View Paper: https://www.semanticscholar.org/paper/18f63d843bc2dadf606e0d95c0d7895ae47c37b5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computer Vision and Pattern Recognition
In Signal Processing
Citations in the corpus
- Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases (2013, methodology): “In contrast, in those query/data sets, QuickSI [12] often outperforms more recent competitors, such as GraphQL and SPath, when it chooses a good matching order.”
- An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases (2012, methodology): “The AIDS dataset was used in [11].”