Graph clustering using the weighted minimum common supergraph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2726, Issue , 2003, Pages 235-246

  Bunke, Horst ^a   Foggia, P ^b   Guidobaldi, C ^b   Vento, M ^c  

^a UNIVERSITY OF BERN   (Switzerland)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^c UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; GRAPHIC METHODS;

GRAPH CLUSTERING; INFORMATION SHARED; REAL OBJECTS; SCIENCE AND ENGINEERING; SIMILAR PATTERN; STRUCTURAL METHODS; SUPERGRAPH; VERSATILE TOOLS;

PATTERN RECOGNITION;

EID: 35248884846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45028-9_21     Document Type: Article

References (16)

1. H. Bunke, P. Foggia, C. Guidobaldi, C. Sansone, M. Vento: A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs SSPR/SPR2002, pp 123-132. 2002.
2. H. Bunke, M. Vento, Benchmarking of Graph Matching Algorithms, Proc. 2nd Workshop on Graph-based Representations, Haindorf, pp. 109-114, 1999.
3. H. Bunke, X. Jiang, A. Kandel, On the Minimum Common Supergraph of two Graphs, Computing 65, No. 1, pp. 13-25, 2000.
4. R.O. Duda, P.E. Hart, D.G. Stork. Pattern Classification, II Ed., Wiley-Interscience Publication. 2000.
5. M. Hagenbuchner, A.C. Tsoi, The Traffic Policeman Benchmark. European Symposium on Artificial Neural Networks, Michel Verleysen, D-Facto, pp. 63-68, April, 1999.
6. C. De Mauro, M. Diligenti, M. Gori, M. Maggini, Similarity Learning for Graph-Based Image Representations. Proceedings of the 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 250-259. 2001.
7. R. Englert, R. Glantz, Towards the Clustering of Graphs. Proceedings of the 2nd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 125-133. 1999.
8. S. Günter, H. Bunke, Self-organizing Map for Clustering in the Graph Domain, Pattern Recognition Letters 23, pp. 401-417. Accepted for Publication.
9. P. Foggia, C. Sansone, M. Vento, A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking, Proc. of the 3rd IAPR TC-15 International Workshop on Graph-based Representations, Italy, pp. 176-187, 2001.
10. B. Luo, A. Robles-Kelly, A. Torsello, R.C. Wilson, E. R. Hancock, Clustering Shock Trees. Proceedings of the 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 217-228. 2001.
11. B. Luo, R.C. Wilson, E. R. Hancock, Spectral Feature Vectors for Graph Clustering. Proceeding of the Joint IAPR International Workshops SSPR and SPR, pp. 83-93. 2002.
12. J.J. McGregor, Backtrack Search Algorithms and the Maximal Common Subgraph Problem, Software Practice and Experience, Vol. 12, pp. 23-34, 1982.
13. D. Seong, H. S. Kim, K.H. Park, Incremental clustering of attributed graphs. IEEE Transactions on Systems, Man and Cybernetics. Vol. 23-5, pp. 1399-1411. 1993.
14. A. Sanfeliu, F. Serratosa, R. Alquezar, Clustering of attributed graphs and unsupervised synthesis of function-described graphs. Proceedings of 15th International Conference on Pattern Recognition, pp. 1022-1025. 2000.
15. A. Sanfeliu, F. Serratosa, R. Alquezar, Synthesis of Function-Described Graphs and Clustering of Attributed Graphs. International Journal of Pattern Recognition and Artificial-Intelligence, Vol.16, No.6, pp. 621-655. 2002.
16. A.K.C. Wong, J. Constant, M.L. You, Random Graphs, in Syntactic and Structural Pattern Recognition - Theory and Applications 4:197-234, H. Bunke and A. Sanfeliu (Eds.), World Sci. Pub. Co., 1990.