-
1
-
-
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
-
2
-
-
0003878763
-
-
North-Holland, Amsterdam
-
C. Berge, Hypergraphs. North-Holland, Amsterdam, 1989
-
(1989)
Hypergraphs
-
-
Berge, C.1
-
3
-
-
0035294770
-
Hypergraph imaging: An overview
-
A. Bretto, H. Cherifi, and D. Aboutajdine. Hypergraph imaging: An overview. Pattern Recognition, 35(3):651-658, 2002
-
(2002)
Pattern Recognition
, vol.35
, Issue.3
, pp. 651-658
-
-
Bretto, A.1
Cherifi, H.2
Aboutajdine, D.3
-
4
-
-
24644442323
-
Hypergraph-based image representation
-
Proceedings of the 5th International Workshop on Graph-Based Representations in Pattern Recognition, Springer, Berlin Heidelberg New York
-
C. Bretto and L. Gillibert. Hypergraph-based image representation. In Proceedings of the 5th International Workshop on Graph-Based Representations in Pattern Recognition, volume 3434, LNCS, pages 1-11. Springer, Berlin Heidelberg New York, 2005
-
(2005)
LNCS
, vol.3434
, pp. 1-11
-
-
Bretto, C.1
Gillibert, L.2
-
6
-
-
33745129869
-
Generalization of two hypergraphs. Algorithm of calculation of the greatest sub-hypergraph common to two hypergraphs annotated by semantic information
-
Springer, Berlin Heidelberg New York
-
D. Demko. Generalization of two hypergraphs. Algorithm of calculation of the greatest sub-hypergraph common to two hypergraphs annotated by semantic information. In Graph Based Representations in Pattern Recognition, Computing. Supplement 12, pages 1-10. Springer, Berlin Heidelberg New York, 1998
-
(1998)
Graph Based Representations in Pattern Recognition, Computing
, Issue.SUPPL.EMENT 12
, pp. 1-10
-
-
Demko, D.1
-
7
-
-
33745173833
-
Theoretical and algorithmic framework for hypergraph matching
-
Proceedings of the 13th International Conference on Image Analysis and Processing, Springer, Berlin Heidelberg New York
-
H. Bunke, P. Dickinson, M. Kraetzl. Theoretical and algorithmic framework for hypergraph matching. In Proceedings of the 13th International Conference on Image Analysis and Processing, volume 3617, LNCS, pages 463-470. Springer, Berlin Heidelberg New York, 2005
-
(2005)
LNCS
, vol.3617
, pp. 463-470
-
-
Bunke, H.1
Dickinson, P.2
Kraetzl, M.3
-
9
-
-
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
-
10
-
-
0019909679
-
Backtrack search algorithm and the maximal common subgraph problem
-
J. McGregor. Backtrack search algorithm and the maximal common subgraph problem. Software Practice and Experience, 12(1):23-34, 1982
-
(1982)
Software Practice and Experience
, vol.12
, Issue.1
, pp. 23-34
-
-
McGregor, J.1
-
11
-
-
0020752197
-
A distance measure between attributed relational graphs for pattern recognition
-
353-363
-
A. Sanfeliu, K. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics (Part B), 13(3):353-363, 1983
-
(1983)
IEEE Transactions on Systems, Man, and Cybernetics (Part B)
, vol.13
, Issue.3
-
-
Sanfeliu, A.1
Fu, K.2
-
13
-
-
0032024433
-
A graph distance metric based on the maximal common subgraph
-
H. Bunke, K. Shearer. 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
Shearer, K.2
-
14
-
-
0035339347
-
Graph distances using graph union
-
W. Wallis, P. Shoubridge, M. Kraetzl, D. Ray. Graph distances using graph union. Pattern Recognition Letters, 22(6):701-704, 2001
-
(2001)
Pattern Recognition Letters
, vol.22
, Issue.6
, pp. 701-704
-
-
Wallis, W.1
Shoubridge, P.2
Kraetzl, M.3
Ray, D.4
-
15
-
-
0035339250
-
A graph distance metric combining maximum common subgraph and minimum common supergraph
-
M.L. Fernandez, G. Valiente. A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters, 22(6-7):753-758, 2001
-
(2001)
Pattern Recognition Letters
, vol.22
, Issue.6-7
, pp. 753-758
-
-
Fernandez, M.L.1
Valiente, G.2
-
16
-
-
0021022807
-
Inexact graph matching for structural pattern recognition
-
H. Bunke, G. Allermann. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters, 1:245-253, 1983
-
(1983)
Pattern Recognition Letters
, vol.1
, pp. 245-253
-
-
Bunke, H.1
Allermann, G.2
-
17
-
-
0025431841
-
An algorithm for graph optimal monomorphism
-
A. Wong, M. You, S. Chan. An algorithm for graph optimal monomorphism. IEEE Transactions on Systems, Man, and Cybernetics, 20(3):628-638, 1990
-
(1990)
IEEE Transactions on Systems, Man, and Cybernetics
, vol.20
, Issue.3
, pp. 628-638
-
-
Wong, A.1
You, M.2
Chan, S.3
-
18
-
-
84899829959
-
A formal basis for the heuristic determination of minimum cost paths
-
P. Hart, N. Nilsson, B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems, Science, and Cybernetics, 4(2):100-107, 1968
-
(1968)
IEEE Transactions of Systems, Science, and Cybernetics
, vol.4
, Issue.2
, pp. 100-107
-
-
Hart, P.1
Nilsson, N.2
Raphael, B.3
-
20
-
-
0021120530
-
Fingerprint pattern classification
-
M. Kawagoe, A. Tojo. Fingerprint pattern classification. Pattern Recognition, 17:295-303, 1984
-
(1984)
Pattern Recognition
, vol.17
, pp. 295-303
-
-
Kawagoe, M.1
Tojo, A.2
-
21
-
-
0030104477
-
Fingerprint classification
-
K. Karu, A. Jain. Fingerprint classification. Pattern Recognition, 29(3):389-404, 1996
-
(1996)
Pattern Recognition
, vol.29
, Issue.3
, pp. 389-404
-
-
Karu, K.1
Jain, A.2
-
23
-
-
1342275940
-
-
Springer, Berlin Heidelberg New York
-
D. Maltoni, D. Maio, A. Jain, S. Prabhakar. Handbook of Fingerprint Recognition. Springer, Berlin Heidelberg New York, 2003
-
(2003)
Handbook of Fingerprint Recognition
-
-
Maltoni, D.1
Maio, D.2
Jain, A.3
Prabhakar, S.4
-
24
-
-
26444528908
-
-
M. Neuhaus, H. Bunke. A graph matching based approach to fingerprint classification using directional variance. In Proceedings of 5th International Conference on Audio- and Video-Based Biometric Person Authentication, 3546, LNCS, pages 191-200. Springer, Berlin, Heidleberg, New York, 2005
-
M. Neuhaus, H. Bunke. A graph matching based approach to fingerprint classification using directional variance. In Proceedings of 5th International Conference on Audio- and Video-Based Biometric Person Authentication, volume 3546, LNCS, pages 191-200. Springer, Berlin, Heidleberg, New York, 2005
-
-
-
-
25
-
-
33749585254
-
Fast suboptimal algorithms for the computation of graph edit distance
-
Proceedings of the Institute Workshop on Structural, and Syntactical Pattern Recognition, Springer, Berlin Heidelberg New York
-
M. Neuhaus, K. Riesen, H. Bunke. Fast suboptimal algorithms for the computation of graph edit distance. In Proceedings of the Institute Workshop on Structural, and Syntactical Pattern Recognition, volume 4109, LNCS, pages 163-172. Springer, Berlin Heidelberg New York, 2006
-
(2006)
LNCS
, vol.4109
, pp. 163-172
-
-
Neuhaus, M.1
Riesen, K.2
Bunke, H.3
-
26
-
-
38149054971
-
Bipartite graph matching for computing the edit distance of graphs
-
F. Escolano and M. Vento, editors, Graph-Based Representations in Pattern Recognition, Springer
-
K. Riesen, M. Neuhaus, H. Bunke. Bipartite graph matching for computing the edit distance of graphs. In F. Escolano and M. Vento, editors, Graph-Based Representations in Pattern Recognition, LNCS 4538, Springer, 2007, 1-12.
-
(2007)
LNCS
, vol.4538
, pp. 1-12
-
-
Riesen, K.1
Neuhaus, M.2
Bunke, H.3
|