Recognition and Shape Synthesis of 3-D Objects Based on Attributed Hypergraphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
The structure-mapping engine: algorithm and examples
Artificial Intelligence
A parallel genetic heuristic for the quadratic assignment problem
Proceedings of the third international conference on Genetic algorithms
3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Match algorithms for generalized Rete networks
Artificial Intelligence
Model matching in robot vision by subgraph isomorphism
Pattern Recognition
Recognizing 3-D objects by forward checking constrained tree search
Pattern Recognition Letters
Conceptual graph matching: a flexible algorithm and experiments
Journal of Experimental & Theoretical Artificial Intelligence - Special issue: conceptual graphs workshop
Organizing Large Structural Modelbases
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic Learning and Recognition of Graphical Symbols in Engineering Drawings
Selected Papers from the First International Workshop on Graphics Recognition, Methods and Applications
Using Genetic Algorithms to Solve NP-Complete Problems
Proceedings of the 3rd International Conference on Genetic Algorithms
Are Case-Based Reasoning and Dissimilarity-Based Classification Two Sides of the Same Coin?
MLDM '01 Proceedings of the Second International Workshop on Machine Learning and Data Mining in Pattern Recognition
Why Case-Based Reasoning Is Attractive for Image Interpretation
ICCBR '01 Proceedings of the 4th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
A technology-independent CAD tool for ESD protection device extraction: ESDExtractor
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Learning attack strategies from intrusion alerts
Proceedings of the 10th ACM conference on Computer and communications security
Common subgraph isomorphism detection by backtracking search
Software—Practice & Experience
An ontology-based publish/subscribe system
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Pattern Recognition Letters - Special issue: In memoriam Azriel Rosenfeld
Extracting statistical data frames from text
ACM SIGKDD Explorations Newsletter - Natural language processing and text mining
A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Distributed recursive learning for shape recognition through multiscale trees
Image and Vision Computing
Design Pattern Detection Using Similarity Scoring
IEEE Transactions on Software Engineering
An efficient graph-based recognizer for hand-drawn symbols
Computers and Graphics
Towards understanding expression for tele-operation
International Journal of Computer Applications in Technology
A Comparison of Different Conceptual Structures Projection Algorithms
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
External memory layout vs. schematic
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A novel approach for efficient supergraph query processing on graph databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Exploiting knowledge ontology and software agents for PPI network analysis
Expert Systems with Applications: An International Journal
Complete enumeration of compact structural motifs in proteins
ISB '10 Proceedings of the International Symposium on Biocomputing
Data mining on multimedia data
Data mining on multimedia data
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
Efficient algorithms for supergraph query processing on graph databases
Journal of Combinatorial Optimization
Incident mining using structural prototypes
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Modeling of remote sensing image content using attributed relational graphs
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Knowledge hiding from tree and graph databases
Data & Knowledge Engineering
Pattern analysis with graphs: Parallel work at Bern and York
Pattern Recognition Letters
NURBS skeleton: a new shape representation scheme using skeletonization and NURBS curves modeling
CIARP'11 Proceedings of the 16th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
A comparative study of ant colony optimization and reactive search for graph matching problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
Graphs are a powerful and universal data structure useful in various subfields of science and engineering. In this paper, we propose a new algorithm for subgraph isomorphism detection from a set of a priori known model graphs to an input graph that is given online. The new approach is based on a compact representation of the model graphs that is computed offline. Subgraphs that appear multiple times within the same or within different model graphs are represented only once, thus reducing the computational effort to detect them in an input graph. In the extreme case where all model graphs are highly similar, the run-time of the new algorithm becomes independent of the number of model graphs. Both a theoretical complexity analysis and practical experiments characterizing the performance of the new approach will be given.