On graphs with unique node labels

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

Volumn 2726, Issue , 2003, Pages 13-23

  Dickinson, Peter J ^a   Bunke, Horst ^b   Dadej, Arek ^c   Kraetzl, Miro ^a  

^a DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

^b UNIVERSITY OF BERN   (Switzerland)

^c UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPHIC METHODS; PATTERN RECOGNITION; SET THEORY;

AS GRAPH; MATCHING ALGORITHM; MAXIMUM COMMON SUBGRAPH; SPECIAL CLASS; SUBGRAPH ISOMORPHISM;

GRAPH THEORY;

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

References (18)

1. IEEE Trans. PAMI, Special Section on Graph Algorithms and Computer Vision, Vol. 23(10), 2001, 1049-1151
2. Pattern Recognition Letters, Special Issue on Graph Based Representation, 2003, to appear
3. McKay, B.D.: Practical Graph Isomorphism, Congressus Numerantium, Vol. 30, 1981, 45-87
4. Ullman, J.R.: An algorihm for subgraph isomorphism, Journal of the ACM, Vol. 23(1), 1976, 31-42
5. McGregor, J.: Backtrack search algorithms and the maximal common subgraph problem, Software-Practice and Experience, Vol. 12, 1982, 23-13
6. Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs, Calcolo 9, 1972, 341-354
7. Sanfeliu, A., Fu, K.S.: A Distance Measure Between Attributed Relational Graphs for Pattern Recognition, IEEE Trans. SMC, Vol. 13(3), 1983, 353-363
8. Messmer, B.T., Bunke, H.: A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection, IEEE Trans. PAMI, Vol. 20(5), 1998, 493-507
9. Cordella, L.P., Foggia, P., Sansome, C., Vento, M.: An Improved Algorithm for Matching Large Graphs, Proceedings of the 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, 2001, 149-159
10. Larrosa, J., Valiente, G.: Constraint satisfaction algorithms for graph pattern matching, Math. Struct. in Computer Science, Vol. 12, 2002, 403-422
11. Christmas, W.J., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation, IEEE Trans. PAMI, Vol. 17(8), 1995, 749-764
12. Wang, I., Fan, K-C., Horng, J-T.: Genetic-based search for error-correcting graph isomorphism, IEEE Trans. SMC, Vol. 27(4), 1997, 588-597
13. Hopcroft, J. E., Wong, J.: Linear time algorithm for isomorphism of planar graphs, Proceedings of the 6th Annual ACM Symposium on Theory of Computing, 1974, 172-184
14. Luks, E.M.: Isomorphism of Graphs of Bounded Valence Can Be Tested In Polynomial Time, Journal of Computer and Systems Sciences, Vol. 25, 1982, 42-65
15. Pelillo, M.: Matching Free Trees, Maximal Cliques and Monotone Game Dynamics, IEEE Trans. PAMI, Vol. 24(11), 2002, 1535-1541
16. Schenker, A., Last, M., Bunke, H., Kandel, A.: Clustering of web documents using a graph model, In Antonacopoulos, A., Hu, Jianying (eds), Web Document Analysis: Challenges and Opportunities, World Scientific, 2003, to appear
17. Bunke, H.: Error correcting graph matching: on the influence of the underlying cost function, IEEE Trans. PAMI, Vol. 21, 1999, 917-922
18. Shoubridge, P.J., Kraetzl, M., Wallis, W.D., Bunke, H.: Abnormal Change Detection of Abnormal Change in a Time Series of Graphs, Journal of Interconnection Networks, Vol. 3, 2002, 85-101