메뉴 건너뛰기




Volumn 91, Issue , 2008, Pages 131-154

Matching of hypergraphs - Algorithms, applications, and experiments

Author keywords

[No Author keywords available]

Indexed keywords


EID: 40449092571     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-76831-9_6     Document Type: Article
Times cited : (27)

References (26)
  • 2
    • 0003878763 scopus 로고
    • North-Holland, Amsterdam
    • C. Berge, Hypergraphs. North-Holland, Amsterdam, 1989
    • (1989) Hypergraphs
    • Berge, C.1
  • 4
    • 24644442323 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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
  • 13
    • 0032024433 scopus 로고    scopus 로고
    • 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
  • 15
    • 0035339250 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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
  • 20
    • 0021120530 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 24
    • 26444528908 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.