Abstract
The directed graph isomorphism problem is a natural extension of the subtree isomorphism problem and has applications to type systems, functional languages and cyclic term graph rewriting systems. In this paper, we present an efficient algorithm for the ordered labeled directed graph isomorphism problem. Once the pattern graph is preprocessed, the matching process of our algorithm runs in time O(¦E T¦), where ¦E T¦ is the number of edges in the target graph. Our algorithm is particularly useful when the same pattern graph is used many times or the size of the pattern graph is small, which is typically the case in the above applications.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aiken and B. R. Murphy, Implementing regular tree expressions, in Proceedings of 5th ACM Conference on Functional Programming Languages and Computer Architecture, pages 427–447, 1991.
A. Aiken and B. R. Murphy, Static type inference in a dynamically typed language, in Proceedings of Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 279–290, 1991.
A. Corradini, Term rewriting in CT ∑, in Proceedings of International Joint Conference on Theory and Practice of Software Development, pages 468–484, 1993.
N. Dershowitz and S. Kaplan, Rewrite, rewrite, rewrite, rewrite, rewrite ... in Proceedings of Sixteenth Annual Symposium on Principles of Programming Languages, pages 250–259, 1989.
J. Fu, Pattern matching in directed graphs, in Proceedings of 6th Annual Symposium on Combinatorial Pattern Matching, pages 64–77, 1995.
J. R. W. Glauert, J. R. Kennaway and M. R. Sleep, Dactl: An experimental graph rewriting language, in Proceedings of Fourth International Workshop on Graph Grammars and Their Application to Computer Science, pages 378–395, 1990.
R. Grossi, A note on the subtree isomorphism for ordered trees and related problems, Information Processing Letters, 39:81–84, 1991.
N. Heintze and J. Jaffar, A finite presentation theorem for approximating logic programs, in Proceedings of Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 197–209, 1990.
C. M. Hoffmann and M. J. O'Donnell, Pattern matching in trees, Journal of ACM, 29(1):68–95, 1982.
K. H. Holm, Graph matching in operational semantics and typing, in Proceedings of Colloquium on Trees in Algebra and Programming, pages 191–205, 1990.
J. Katzenelson, S. S. Pinter and E. Schenfeld, Type matching, type-graphs, and the Schanuel conjecture, ACM Transactions on Programming Languages and Systems, 14(4):574–588, Oct. 1992.
J. W. Klop, Term rewriting systems, Technical Report CS-R9073, Free University, Department of Mathematics and Computer Science, 1990.
E. Mäkinen, On the subtree isomorphism problem for ordered trees, Information Processing Letters, 32:271–273, 1989.
R. Tarjan, Depth first search and linear graph algorithms, SIAM Journal on Computing, 1(2):146–160, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fu, J.J. (1995). Linear matching-time algorithm for the directed graph isomorphism problem. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015447
Download citation
DOI: https://doi.org/10.1007/BFb0015447
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60573-7
Online ISBN: 978-3-540-47766-2
eBook Packages: Springer Book Archive