Directed Graph Pattern Matching and Topological Embedding |
| |
Authors: | James Jianghai Fu |
| |
Institution: | Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada |
| |
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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|