Ullmann, J.R.,
An Algorithm for Subgraph Isomorphism,
JACM(23), No. 1, January 1976, pp. 31-42.
Graph Isomorphism.
See also Use of Continutiy in Character Recognition, A.
BibRef
7601
Ullmann, J.R.,
Associating Parts of Patterns,
InfoControl(9), 1966, pp. 583-601.
Abstract formulation of discrete relaxation.
BibRef
6600
Ullmann, J.R.[Julian R.],
Bit-vector Algorithms for Binary Constraint
Satisfaction and Subgraph Isomorphism,
JEA(15), No. 1, January 2011, Article 1.6.
PDF Version.
Relaxation.
Constraint Satisfaction. Constraint satisfaction. Binary constraints. Relaxation
BibRef
1101
Eshera, M.A.,
Fu, K.S.,
An Image Understanding System Using Attributed Symbolic
Representation and Inexact Graph-Matching,
PAMI(8), No. 5, September 1986, pp. 604-618.
Generate graphs with labeled arcs and features and match.
BibRef
8609
Tsai, W.H., and
Fu, K.S.,
Subgraph Error-Correcting Isomorphisms for
Syntatic Pattern Recognition,
SMC(13), No. 1, January-February 1983, pp. 48-62.
BibRef
8301
Tsai, W.H., and
Fu, K.S.,
Error-Correcting Isomorphisms of Attributed
Relational Graphs for Pattern Analysis,
SMC(9), No. 12, December 1979, pp. 757-768.
Still an O(l^3n^2) method.
BibRef
7912
Kasif, S.,
Kitchen, L.,
Rosenfeld, A.,
A Hough Transform Technique for Subgraph Isomorphism,
PRL(2), 1983, pp. 83-88.
BibRef
8300
Wong, E.K.,
Model Matching in Robot Vision by Subgraph Isomorphism,
PR(25), No. 3, March 1992, pp. 287-303.
WWW Version.
BibRef
9203
Shoukry, A.,
Aboutabl, M.,
Neural-Network Approach for Solving the Maximal Common Subgraph Problem,
SMC-B(26), No. 5, October 1996, pp. 785-790.
IEEE Top Reference. Hopfield network.
BibRef
9610
El-Sonbaty, Y.[Yasser],
Ismail, M.A.,
A New Algorithm for Subgraph Optimal Isomorphism,
PR(31), No. 2, February 1998, pp. 205-218.
WWW Version.
9802
BibRef
Earlier:
A Graph-Decomposition Algorithm for Graph Optimal Monomorphism,
BMVC97(xx-yy).
HTML Version.
0209
BibRef
Wang, J.T.L.,
Shapiro, B.A.,
Shasha, D.,
Zhang, K., and
Currey, K.M.,
An Algorithm for Finding the Largest Approximately
Common Substructures of Two Trees,
PAMI(20), No. 8, August 1998, pp. 889-895.
IEEE Abstract.
IEEE DOI Link
BibRef
9808
Messmer, B.T.[Bruno T.],
Bunke, H.[Horst],
A New Algorithm for Error Tolerant Subgraph Isomorphism Detection,
PAMI(20), No. 5, May 1998, pp. 493-504.
IEEE Abstract.
IEEE DOI Link
9806
BibRef
Earlier:
Fast error-correcting graph isomorphism based on model precompilation,
CIAP97(I: 693-700).
WWW Version.
9709
BibRef
Earlier: A2, A1:
Efficient attributed graph matching and its application to image
analysis,
CIAP95(44-55).
Springer DOI Link
9509
BibRef
Messmer, B.T.[Bruno T.],
Bunke, H.[Horst],
A decision tree approach to graph and subgraph isomorphism detection,
PR(32), No. 12, December 1999, pp. 1979-1998.
WWW Version.
BibRef
9912
Bunke, H.,
Shearer, K.,
A Graph Distance Metric Based on the Maximal Common Subgraph,
PRL(19), No. 3-4, March 1998, pp. 255-259.
9807
BibRef
Bunke, H.,
Kandel, A.,
Mean and maximum common subgraph of two graphs,
PRL(21), No. 2, February 2000, pp. 163-168.
0003
BibRef
Fernández, M.L.[Mirtha-Lina],
Valiente, G.[Gabriel],
A graph distance metric combining maximum common subgraph and minimum
common supergraph,
PRL(22), No. 6-7, May 2001, pp. 753-758.
Elsevier DOI Link
0105
BibRef
de Piero, F.W.[Fred W.],
Krout, D.[David],
An algorithm using length-r paths to approximate subgraph isomorphism,
PRL(24), No. 1-3, January 2003, pp. 33-46.
Elsevier DOI Link
0211
BibRef
Ferrer, M.[Miquel],
Valveny, E.,
Serratosa, F.[Francesc],
Median graph: A new exact algorithm using a distance based on the
maximum common subgraph,
PRL(30), No. 5, 1 April 2009, pp. 579-588.
Elsevier DOI Link
WWW Version.
0903
Median graph; Maximum common subgraph; Minimum common supergraph;
Graph matching
BibRef
Ferrer, M.,
Valveny, E.,
Serratosa, F.,
Median graphs: A genetic approach based on new theoretical properties,
PR(42), No. 9, September 2009, pp. 2003-2012.
Elsevier DOI Link
WWW Version.
0905
Median graph; Genetic search; Maximum common subgraph; Graph matching;
Structural pattern recognition
BibRef
Ferrer, M.[Miquel],
Serratosa, F.[Francesc],
Sanfeliu, A.[Alberto],
Synthesis of Median Spectral Graph,
IbPRIA05(II:139).
Springer DOI Link
0509
BibRef
Sanromà, G.[Gerard],
Alquézar, R.[René],
Serratosa, F.[Francesc],
A new graph matching method for point-set correspondence using the EM
algorithm and Softassign,
CVIU(116), No. 2, February 2012, pp. 292-304.
Elsevier DOI Link
WWW Version.
1201
BibRef
Earlier: A1, A2, A3:
Smooth Simultaneous Structural Graph Matching and Point-Set
Registration,
GbRPR11(142-151).
Springer DOI Link
1105
BibRef
Earlier: A1, A2, A3:
A Discrete Labelling Approach to Attributed Graph Matching Using SIFT
Features,
ICPR10(954-957).
IEEE DOI Link
1008
BibRef
Earlier: A1, A3, A2:
Shape Learning with Function-Described Graphs,
ICIAR08(xx-yy).
Springer DOI Link
0806
BibRef
And: A1, A3, A2:
Hybrid Genetic Algorithm and Procrustes Analysis for Enhancing the
Matching of Graphs Generated from Shapes,
SSPR08(298-307).
Springer DOI Link
0812
Correspondence problem; Graph matching; Affine registration; Outlier
detection; Expectation maximization; Softassign
BibRef
Sanfeliu, A.,
Serratosa, F.,
Alquézar, R.,
Clustering of Attributed Graphs and Unsupervised Synthesis of
Function-described Graphs,
ICPR00(Vol II: 1022-1025).
IEEE DOI Link
0009
BibRef
Serratosa, F.,
Alquézar, R.,
Sanfeliu, A.,
Efficient Algorithms for Matching Attributed Graphs and
Function-described Graphs,
ICPR00(Vol II: 867-872).
IEEE DOI Link
0009
BibRef
Raveaux, R.[Romain],
Burie, J.C.[Jean-Christophe],
Ogier, J.M.[Jean-Marc],
A graph matching method and a graph matching distance based on subgraph
assignments,
PRL(31), No. 5, 1 April 2010, pp. 394-406.
Elsevier DOI Link
WWW Version.
1002
Graph matching; Graph distance; Bipartite graph matching; Graph based
representation
BibRef
Raveaux, R.[Romain],
Burie, J.C.[Jean-Christophe],
Ogier, J.M.[Jean-Marc],
A local evaluation of vectorized documents by means of polygon
assignments and matching,
IJDAR(15), No. 1, March 2012, pp. 21-43.
WWW Version.
1203
BibRef
Wang, T.[Tao],
Dai, G.J.[Guo-Jun],
Xu, D.[De],
A polynomial algorithm for submap isomorphism of general maps,
PRL(32), No. 8, 1 June 2011, pp. 1100-1107.
Elsevier DOI Link
WWW Version.
1101
Graph; Combinatorial map; Isomorphism; Symbol graph; Pattern recognition
BibRef
Damiand, G.[Guillaume],
Solnon, C.[Christine],
de la Higuera, C.[Colin],
Janodet, J.C.[Jean-Christophe],
Samuel, É.[Émilie],
Polynomial algorithms for subisomorphism of nD open combinatorial maps,
CVIU(115), No. 7, July 2011, pp. 996-1010.
Elsevier DOI Link
WWW Version.
1106
BibRef
Earlier: A1, A3, A4, A5, A2:
A Polynomial Algorithm for Submap Isomorphism:
Application to Searching Patterns in Images,
GbRPR09(102-112).
Springer DOI Link
0905
Open combinatorial maps; Isomorphism and subisomorphism; Pattern
detection; 2D and 3D images
BibRef
Gosselin, S.[Stéphane],
Damiand, G.[Guillaume],
Solnon, C.[Christine],
Signatures of Combinatorial Maps,
IWCIA09(370-382).
Springer DOI Link
0911
Canonical representation of n-d map.
BibRef
Imada, T.[Tomoki],
Nagamochi, H.[Hiroshi],
Indexing All Rooted Subgraphs of a Rooted Graph,
IEICE(E95-D), No. 3, March 2012, pp. 712-721.
WWW Version.
1203
BibRef
Zhang, B.[Baida],
Tang, Y.H.[Yu-Hua],
Wu, J.[Junjie],
Huang, L.[Linqi],
A Unique Vertex Deleting Algorithm for Graph Isomorphism,
ISIDF11(1-4).
IEEE DOI Link
1111
BibRef
Weber, M.[Markus],
Liwicki, M.[Marcus],
Dengel, A.R.[Andreas R.],
Indexing with Well-Founded Total Order for Faster Subgraph Isomorphism
Detection,
GbRPR11(185-194).
Springer DOI Link
1105
BibRef
Ozdemir, B.[Bahadir],
Aksoy, S.[Selim],
Image Classification Using Subgraph Histogram Representation,
ICPR10(1112-1115).
IEEE DOI Link
1008
Image representation graphs and bag-of-words. Graph of local patches,
histogram of subgraphs.
BibRef
Schellewald, C.[Christian],
A Bound for Non-subgraph Isomorphism,
GbRPR07(71-80).
Springer DOI Link
0706
BibRef
Schellewald, C.[Christian],
Schnörr, C.[Christoph],
Probabilistic Subgraph Matching Based on Convex Relaxation,
EMMCVPR05(171-186).
Springer DOI Link
0601
BibRef
Saxena, T.[Tushar],
Tu, P.[Peter],
Hartley, R.I.[Richard I.],
Recognizing Objects in Cluttered Images Using Subgraph Isomorphism,
DARPA98(875-882).
PDF Version.
BibRef
9800
Akinniyi, F.A., and
Wong, A.K.C.,
A New Product Graph Based Algorithm for Subgraph Isomorphism,
CVPR83(457-467).
BibRef
8300
Chapter on Matching and Recognition Using Volumes, High Level Vision Techniques, Invariants continues in
Matching Graphs and 3-D Network Descriptions .