Subgraph isomorphism detection in polynomial time on preprocessed model graphs

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

Volumn 1035, Issue , 1996, Pages 373-382

  Messmer, B T ^a   Bunke, H ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; DECISION TREES; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; SET THEORY;

INPUT GRAPHS; POLYNOMIAL-TIME; PRUNING TECHNIQUES; RUNTIMES; SUBGRAPH ISOMORPHISM; TREE REPRESENTATION;

TREES (MATHEMATICS);

EID: 84921739434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60793-5_91     Document Type: Conference Paper

References (7)

1. H. Bunke. Structural and syntactic pattern recognition. In C. H. Chen, L. F. Pau, and P. Wang, editors, Handbook of Pattern Recognition and Computer Vision, pages 163-209. World Scientific Publ. Co. Singapore, 1993.
2. J. R. Ullman. An algorithm for subgraph isomorphism. Journal of the Association for Computing Machinery, 23(1): 31-42, 1976.
3. W. J. Christmas, J. Kittler, and M. Petrou. Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI, 17(8): 749-764, 1995.
4. R. Horaud and T. Skordas. Stereo correspondence through feature grouping and maximal cliques. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI, 11(11): 1168-1180, 1989.
5. C. M. Hoffman. Group-theoretic Algorithms and Graph Isomorphism. Springer Verlag, 1982.
6. E. M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences, pages 42-65, 1982.
7. B. T. Messmer and H. Bunke. Subgraph isomorphism in polynomial time. Technical Report IAM-95-003, University of Bern, 1995.