Marked subgraph isomorphism of ordered graphs

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

Volumn 1451, Issue , 1998, Pages 122-131

  Jiang, Xiaoyi ^a   Bunke, Horst ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; SET THEORY;

QUADRATIC TIME; SUB-CIRCUITS; SUBGRAPH ISOMORPHISM; SUBGRAPH ISOMORPHISM PROBLEM;

PATTERN RECOGNITION;

EID: 84947814936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0033230     Document Type: Conference Paper

References (11)

1. P. Dublish, Some comments on the subtree isomorphism problem for ordered trees, Information Processing Letters, 36: 273-275, 1990.
2. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman and Co., 1979.
3. J.E. Hopcroft and J.K. Wong, Linear time algorithm for isomorphism of planar graphs, Proe. of 6th Annual ACM Symposium on Theory of Computing, 172-184, 1974.
4. X. Jiang and H. Bunke, A simple and efficient algorithm for determining the symmetries of polyhedra, Graphical Models and Image Processing, 54(1):91-95, 1992.
5. X. Jiang, K. Yu, and H. Bunke, Detection of rotational and invotutationat symmetries and congruity of polyhedra, The Visual Computer, 12(4): 193-201, 1996.
6. X. Jiang and H. Bunke, Including geometry in graph representations: A quadratictime graph isomorphism algorithm and its applications, In Advances in Structural and Syntactical Pattern Recognition (P. Perner, P. Wang, A. Rosenfeld, Eds.), Lectures Notes in Computer Science 1121, Springer-Verlag, 110-119, 1996.
7. X. Jiang and H. Bunke, On the coding of ordered graphs, Computing, 1998. (to appear)
8. S. Kasif, L. Kitchen, and A. Rosenfeld, A Hough transform technique for subgraph isomorphism, Pattern Recognition Letters, 2: 83-88, 1983.
9. E.M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, Journal of Computer and System Science, 25: 42-65, 1982.
10. M. Ohlrich et al., SubGemini: Identifying subcircuits using a fast subgraph isomorphism algorithm, Proc. of 30th ACM/IEEE Design Automation Conference, 31-37, 1993.
11. N. Vijaykrishnan and N. Ranganathan, SUBGEN: A genetic approach for subcircuit extraction, Proc. of Int. Conf. on VLSI Design, Bangalore, 1996.