Efficient subgraph isomorphism detection: a decomposition approach
- 1 January 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 12 (2), 307-323
- https://doi.org/10.1109/69.842269
Abstract
No abstract availableThis publication has 31 references indexed in Scilit:
- Organizing large structural modelbasesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1995
- Rulegraphs for graph matching in pattern recognitionPattern Recognition, 1994
- Partitioning graph matching with constraintsPattern Recognition, 1994
- Incremental clustering of attributed graphsIEEE Transactions on Systems, Man, and Cybernetics, 1993
- Match algorithms for generalized Rete networksArtificial Intelligence, 1992
- Conceptual graph matching: a flexible algorithm and experimentsJournal of Experimental & Theoretical Artificial Intelligence, 1992
- Model matching in robot vision by subgraph isomorphismPattern Recognition, 1992
- Hierarchical attributed graph representation and recognition of handwritten chinese charactersPattern Recognition, 1991
- 3-D object recognition using bipartite matching embedded in discrete relaxationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1991
- Recognition and shape synthesis of 3-D objects based on attributed hypergraphsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1989