research-article

Directed Graph Pattern Matching and Topological Embedding

Author:

James Jianghai FuAuthors Info & Claims

Journal of Algorithms, Volume 22, Issue 2

Pages 372 - 391

https://doi.org/10.1006/jagm.1996.0818

Published: 01 February 1997 Publication History

Abstract

Pattern matching in directed graphs is a natural extension of pattern matching in trees and has many applications to different areas. In this paper, we study several pattern matching problems in ordered labeled directed graphs. For the rooted directed graph pattern matching problem, we present an efficient algorithm which, given a pattern graphPand a target graphT, runs in time and spaceO(|EP||VT|+|ET|). It is faster than the best known method by a factor ofmin{|ET|,|EP||VT|}. This algorithm can also solve the directed graph pattern matching problem without increasing time or space complexity. Our solution to this problem outperforms the best existing method by Katzenelson, Pinter and Schenfeld by a factor ofmin{|VP||ET|,|VP||EP||VT|}. We also present an algorithm for the directed graph topological embedding problem which runs in timeO(|VP||ET|+|EP|) and spaceO(|VP||VT|+|EP|+|ET|). To our knowledge, this algorithm is the first one for this problem.

References

[1]

A.V. Aho, R. Sethi, J.D. Ullman, Addison-Wesley, Reading, 1986.

[2]

A. Aiken, B. R. Murphy, 1991, Implementing regular tree expressions, Proceedings, 5th ACM Conference on Functional Programming Languages and Computer Architecture, 1991, 427, 447

[3]

A. Aiken, B. R. Murphy, 1991, Static type inference in a dynamically typed language, Proceedings, Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991, 279, 290

Digital Library

[4]

S. A. Cook, 1971, The complexity of theorem-proving procedures, Proceedings, in 3rd Annual Symposium on the Theory of Computing, 1971, 151, 158

[5]

A. Corradini, 1993, Term rewriting inCT¿, Proceedings, International Joint Conference on Theory and Practice of Software Development, 1993, 468, 484

[6]

N. Dershowitz, S. Kaplan, 1989, Rewrite, rewrite, rewrite, rewrite, rewrite,¿ Proceedings, Sixteenth Annual Symposium on Principles of Programming Languages, 1989, 250, 259

[7]

M. Dubiner, Z. Galil, E. Magen, 1990, Faster tree pattern matching, Proceedings, IEEE Symposium on Foundations of Computer Science, 1990, 145, 150

Digital Library

[8]

J. R. W. Glauert, J. R. Kennaway, M. R. Sleep, 1990, Dactl: An experimental graph rewriting language, Proceedings, Fourth International Workshop on Graph Grammars and Their Application to Computer Science, 1990, 378, 395

[9]

J. Fu, 1995, Pattern matching in directed graphs, Proceedings, Sixth Annual Symposium on Combinatorial Pattern Matching, 1995, 64, 77

[10]

N. Heintze, J. Jaffar, 1990, A finite presentation theorem for approximating logic programs, Proceedings, Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990, 197, 209

Digital Library

[11]

C.M. Hoffmann, M.J. O'Donnell, Pattern matching in trees, J. Assoc. Comput. Mach., 29 (1982) 68-95.

Digital Library

[12]

K. H. Holm, 1990, Graph matching in operational semantics and typing, Proceedings, Colloquium on Trees in Algebra and Programming, 1990, 191, 205

[13]

J.E. Hopcroft, R.M. Karp, Ann5/2, SIAM J. Comput., 3 (1973) 225-231.

[14]

J. Katzenelson, S.S. Pinter, E. Schenfeld, Type matching, type-graphs, and the Schanuel conjecture, ACM Trans. Programming Lang. Syst., 14 (1992) 574-588.

Digital Library

[15]

J. W. Klop, 1990, Term rewriting systems, Department of Mathematics and Computer Science, Free University

[16]

S. R. Kosaraju, 1980, Efficient tree pattern matching, Proceedings, IEEE Symposium on Foundations of Computer Science, 1980, 178, 183

[17]

R. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput., 1 (1972) 146-160.

Cited By

De Carvalho JKuzma BKorostelev IAmaral JBarton CMoreira JAraujo G(2021)KernelFaRerACM Transactions on Architecture and Code Optimization10.1145/345901018:3(1-22)Online publication date: 28-Jun-2021
https://dl.acm.org/doi/10.1145/3459010
Kawahito MKomatsu HMoriyama TInoue HNakatani T(2013)Idiom recognition framework using topological embeddingACM Transactions on Architecture and Code Optimization10.1145/251243110:3(1-34)Online publication date: 16-Sep-2013
https://dl.acm.org/doi/10.1145/2512431
Damgaard TGlenstrup ABirkedal LMilner R(2013)An inductive characterization of matching in binding bigraphsFormal Aspects of Computing10.1007/s00165-011-0184-525:2(257-288)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1007/s00165-011-0184-5
Show More Cited By

Index Terms

Directed Graph Pattern Matching and Topological Embedding
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching

Recommendations

Pattern matching in directed graphs
Read More
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph

Let D be a directed graph with vertex set V , arc set A , and order n . The graph underlying D is the graph obtained from D by replacing each arc ( u , v ) A by an undirected edge { u , v } and then replacing each double edge by a single edge. An anti-...
Read More
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles

We consider the pattern detection problem in graphs: given a constant size pattern graph $H$ and a host graph $G$, determine whether $G$ contains a subgraph isomorphic to $H$. We present the following new improved upper and lower bounds: We prove that if a ...
Read More

Comments

Information & Contributors

Information

Published In

cover image Journal of Algorithms

Journal of Algorithms Volume 22, Issue 2

Feb. 1997

195 pages

ISSN:0196-6774

Editors:
Zvi Galil
Columbia Univ., New York, NY
,
David S. Johnson
AT&T Bell Labs, Murray Hill, NJ
,
Donald E. Knuth
Stanford Univ., Stanford, CA

Issue’s Table of Contents

Copyright © Academic Press.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 February 1997

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

De Carvalho JKuzma BKorostelev IAmaral JBarton CMoreira JAraujo G(2021)KernelFaRerACM Transactions on Architecture and Code Optimization10.1145/345901018:3(1-22)Online publication date: 28-Jun-2021
https://dl.acm.org/doi/10.1145/3459010
Kawahito MKomatsu HMoriyama TInoue HNakatani T(2013)Idiom recognition framework using topological embeddingACM Transactions on Architecture and Code Optimization10.1145/251243110:3(1-34)Online publication date: 16-Sep-2013
https://dl.acm.org/doi/10.1145/2512431
Damgaard TGlenstrup ABirkedal LMilner R(2013)An inductive characterization of matching in binding bigraphsFormal Aspects of Computing10.1007/s00165-011-0184-525:2(257-288)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1007/s00165-011-0184-5
Kawahito MKomatsu HMoriyama TInoue HNakatani T(2006)A new idiom recognition framework for exploiting hardware-assist instructionsACM SIGARCH Computer Architecture News10.1145/1168919.116890534:5(382-393)Online publication date: 20-Oct-2006
https://dl.acm.org/doi/10.1145/1168919.1168905
Kawahito MKomatsu HMoriyama TInoue HNakatani T(2006)A new idiom recognition framework for exploiting hardware-assist instructionsACM SIGPLAN Notices10.1145/1168918.116890541:11(382-393)Online publication date: 20-Oct-2006
https://dl.acm.org/doi/10.1145/1168918.1168905
Kawahito MKomatsu HMoriyama TInoue HNakatani T(2006)A new idiom recognition framework for exploiting hardware-assist instructionsACM SIGOPS Operating Systems Review10.1145/1168917.116890540:5(382-393)Online publication date: 20-Oct-2006
https://dl.acm.org/doi/10.1145/1168917.1168905
Kawahito MKomatsu HMoriyama TInoue HNakatani TShen JMartonosi M(2006)A new idiom recognition framework for exploiting hardware-assist instructionsProceedings of the 12th international conference on Architectural support for programming languages and operating systems10.1145/1168857.1168905(382-393)Online publication date: 23-Oct-2006
https://dl.acm.org/doi/10.1145/1168857.1168905

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents