-
1
-
-
22444455831
-
A graph isomorphism algorithm for object recognition
-
M. Abdulrahim and M. Misra. A graph isomorphism algorithm for object recognition. Pattern Analysis and Applications, 1(3):189-201, 1998.
-
(1998)
Pattern Analysis and Applications
, vol.1
, Issue.3
, pp. 189-201
-
-
Abdulrahim, M.1
Misra, M.2
-
2
-
-
0022808049
-
-
E. Balas and C. S. Yu. Finding a maximum clique in an arbitrary graph. SIAM J. Computing, 15(4), 1986.
-
E. Balas and C. S. Yu. Finding a maximum clique in an arbitrary graph. SIAM J. Computing, 15(4), 1986.
-
-
-
-
4
-
-
26144456566
-
-
Kluver Academic Publisher, Boston Pattern MA
-
I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo. The Maximum Clique Problem, volume 4 of Handbook of Combinatorial Optimization. Kluver Academic Publisher, Boston Pattern MA, 1999.
-
(1999)
The Maximum Clique Problem, volume 4 of Handbook of Combinatorial Optimization
-
-
Bomze, I.M.1
Budinich, M.2
Pardalos, P.M.3
Pelillo, M.4
-
5
-
-
0001296418
-
Finding all the cliques in an undirected graph
-
C. Bron and J. Kerbosch. Finding all the cliques in an undirected graph. Communication of the ACM, 16:189-201, 1973.
-
(1973)
Communication of the ACM
, vol.16
, pp. 189-201
-
-
Bron, C.1
Kerbosch, J.2
-
6
-
-
0005964682
-
Generation of images databases using attributed plex grammars
-
H. Bunke, M. Gori, M. Hagenbuchner, C. Irniger, and A. Tsoi. Generation of images databases using attributed plex grammars. In Proc. of the 3rd IAPR TC-15 International Workshop on Graph-based Representations, pages 200-209, 2001.
-
(2001)
Proc. of the 3rd IAPR TC-15 International Workshop on Graph-based Representations
, pp. 200-209
-
-
Bunke, H.1
Gori, M.2
Hagenbuchner, M.3
Irniger, C.4
Tsoi, A.5
-
7
-
-
0043283912
-
On the minimum common supergraph of two graphs
-
H. Bunke, X. Jiang, and A. Kandel. On the minimum common supergraph of two graphs. Computing, 65(1):13-25, 2000.
-
(2000)
Computing
, vol.65
, Issue.1
, pp. 13-25
-
-
Bunke, H.1
Jiang, X.2
Kandel, A.3
-
8
-
-
0032024433
-
A graph distance metric based on the maximal common subgraph
-
H. Bunke and K.Sharer. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19(3):255-259, 1998.
-
(1998)
Pattern Recognition Letters
, vol.19
, Issue.3
, pp. 255-259
-
-
Bunke, H.1
Sharer, K.2
-
9
-
-
77950069437
-
-
H. Bunke and B. Messmer. Efficient Attributed Graph Matching and its Application to Image Analysis, 974 of Lecture Notes In Computer Science, pages 45-55. Springer-Verlag, proceedings of the 8th international conference on image analysis and processing edition, 1995.
-
H. Bunke and B. Messmer. Efficient Attributed Graph Matching and its Application to Image Analysis, volume 974 of Lecture Notes In Computer Science, pages 45-55. Springer-Verlag, proceedings of the 8th international conference on image analysis and processing edition, 1995.
-
-
-
-
11
-
-
0032663728
-
A minimal line property preserving representation for line images
-
M. Burge and W. G. Kropatsch. A minimal line property preserving representation for line images. Computing, 62(4):355-368, 1999.
-
(1999)
Computing
, vol.62
, Issue.4
, pp. 355-368
-
-
Burge, M.1
Kropatsch, W.G.2
-
13
-
-
85036924907
-
-
A. Chianese, L. Cordella, M. D. Santo, and M. Vento. Classifying Character Shapes, pages 155-164. Visual Form: Analysis and Recognition. Plenum Press, New York, proceedings of the 8th international conference on image analysis and processing edition, 1992.
-
A. Chianese, L. Cordella, M. D. Santo, and M. Vento. Classifying Character Shapes, pages 155-164. Visual Form: Analysis and Recognition. Plenum Press, New York, proceedings of the 8th international conference on image analysis and processing edition, 1992.
-
-
-
-
14
-
-
0029358760
-
Structural matching in computer vision using probabilistic relaxation
-
W. Christmas, J. Kittler, and M. Petrou. Structural matching in computer vision using probabilistic relaxation. IEEE Transaction on Pattern Analysis and Machine Intelligence, 17(8):749-764, 1995.
-
(1995)
IEEE Transaction on Pattern Analysis and Machine Intelligence
, vol.17
, Issue.8
, pp. 749-764
-
-
Christmas, W.1
Kittler, J.2
Petrou, M.3
-
15
-
-
0000253451
-
Molecular structure comparison program for the identification of maximal common substructures
-
M. M. Cone, R. Venkataraghven, and F. W. McLafferty. Molecular structure comparison program for the identification of maximal common substructures. Journal of the American Chemistry Socitey, 99(23):7668-7671, 1977.
-
(1977)
Journal of the American Chemistry Socitey
, vol.99
, Issue.23
, pp. 7668-7671
-
-
Cone, M.M.1
Venkataraghven, R.2
McLafferty, F.W.3
-
16
-
-
3142716665
-
Thirty years of graph matching in pattern recognition
-
D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence, 18(3):265-298, 2004.
-
(2004)
International Journal of Pattern Recognition and Artificial Intelligence
, vol.18
, Issue.3
, pp. 265-298
-
-
Conte, D.1
Foggia, P.2
Sansone, C.3
Vento, M.4
-
17
-
-
84890410415
-
Performance evaluation of the VF graph matching algorithm
-
L. Cordelia, P. Foggia, C. Sansone, and M. Vento. Performance evaluation of the VF graph matching algorithm. In Proc. of the 10th International Conference on Image Analysis and Processing, pages 1172-1177, 1999.
-
(1999)
Proc. of the 10th International Conference on Image Analysis and Processing
, pp. 1172-1177
-
-
Cordelia, L.1
Foggia, P.2
Sansone, C.3
Vento, M.4
-
18
-
-
0001097032
-
An improved algorithm for matching large graphs
-
L. Cordelia, P. Foggia, C. Sansone, and M. Vento. An improved algorithm for matching large graphs. In Proc. of the 3rd IAPR-TC-15 International Workshop on Graph-based Representations, pages 149-159, 2001.
-
(2001)
Proc. of the 3rd IAPR-TC-15 International Workshop on Graph-based Representations
, pp. 149-159
-
-
Cordelia, L.1
Foggia, P.2
Sansone, C.3
Vento, M.4
-
20
-
-
0002733254
-
An efficient algorithm for similarity analysis of molecules
-
P. J. Durand, R. Pasari, J. W. Baker, and C. Tsai. An efficient algorithm for similarity analysis of molecules. Internet Journal of Chemistry, 2, 1999.
-
(1999)
Internet Journal of Chemistry
, vol.2
-
-
Durand, P.J.1
Pasari, R.2
Baker, J.W.3
Tsai, C.4
-
21
-
-
38249014153
-
Introduction to graph grammars with applications to semantic networks
-
H. Ehrig. Introduction to graph grammars with applications to semantic networks. Computers & Mathematics with Applications, 23:557-572, 1992.
-
(1992)
Computers & Mathematics with Applications
, vol.23
, pp. 557-572
-
-
Ehrig, H.1
-
27
-
-
51249191195
-
A note on the derivation of maximal common subgraphs of two directed or undirected graphs
-
G. Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9:341-354, 1972.
-
(1972)
Calcolo
, vol.9
, pp. 341-354
-
-
Levi, G.1
-
28
-
-
0035481623
-
Symbol recognition by error-tolerant subgraph matching between region adjacency graphs
-
J. Llados, E. Marti, and J. Villanueva. Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. IEEE Transaction on Pattern Analysis and Machine Intelligence, 23(10):1137-1143, 2001.
-
(2001)
IEEE Transaction on Pattern Analysis and Machine Intelligence
, vol.23
, Issue.10
, pp. 1137-1143
-
-
Llados, J.1
Marti, E.2
Villanueva, J.3
-
29
-
-
0025904109
-
Hierarchical attributed graph representation and recognition of handwritten Chinese characters
-
S. Lu, Y. Ren, and C. Suen. Hierarchical attributed graph representation and recognition of handwritten Chinese characters. Pattern Recognition, 24:617-632, 1991.
-
(1991)
Pattern Recognition
, vol.24
, pp. 617-632
-
-
Lu, S.1
Ren, Y.2
Suen, C.3
-
30
-
-
0020166327
-
Isomorphism of graphs of bounded valence can be tested in polynomial time
-
E. M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer System Science, pages 42-65, 1982.
-
(1982)
Journal of Computer System Science
, pp. 42-65
-
-
Luks, E.M.1
-
31
-
-
0011423023
-
Sample graphs for isomorphism testing
-
R. Mathon. Sample graphs for isomorphism testing. Congressus Numerantium, 21:499-517, 1978.
-
(1978)
Congressus Numerantium
, vol.21
, pp. 499-517
-
-
Mathon, R.1
-
32
-
-
0019909679
-
Backtrack search algorithms and the maximal common subgraph problem
-
J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Software Practice and Experience, 12:23-34, 1982.
-
(1982)
Software Practice and Experience
, vol.12
, pp. 23-34
-
-
McGregor, J.1
-
37
-
-
0020752197
-
A distance measure between attributed relational graphs for pattern recognition
-
A. Sanfeliu and K. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Transaction on Systems, Man and Cybernetics, 13:353-362, 1983.
-
(1983)
IEEE Transaction on Systems, Man and Cybernetics
, vol.13
, pp. 353-362
-
-
Sanfeliu, A.1
Fu, K.2
-
38
-
-
0002378953
-
Graph matching for video indexing
-
K. Shearer, H. Bunke, S. Venkatesh, and D. Kieronska. Graph matching for video indexing. Computing, 12:53-62, 1998.
-
(1998)
Computing
, vol.12
, pp. 53-62
-
-
Shearer, K.1
Bunke, H.2
Venkatesh, S.3
Kieronska, D.4
|