Directed Graph Pattern Matching and Topological Embedding

@article{Fu1997DirectedGP,
  title={Directed Graph Pattern Matching and Topological Embedding},
  author={James Jianghai Fu},
  journal={J. Algorithms},
  year={1997},
  volume={22},
  pages={372-391}
}
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 graph P and a target graph T , runs in time and space O E V P T < <. < < < < < <4 q E . It is faster than the best known method by a factor of min E… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

From This Paper

Figures and tables from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Sleep, Dactl: An experimental graph rewriting language, in ‘‘Proceedings

J.R.W. Glauert, J. R. Kennaway, R M.
Fourth International Workshop on Graph Grammars and Their Application to Computer Science, • 1990

Term rewriting systems, Technical Report CS-R9073

J. W. Klop
Free University, Department of Mathematics and Computer Science, • 1990

Similar Papers

Loading similar papers…