You are in:Home/Publications/FAST-ON*: AN EXTENDED ALGORITHM FOR GRAPH ISOMORPHISM PROBLEM AND GRAPH QUERY PROCESSING | |
Dr. Mosab abd el-hameed mohamed hassaan :: Publications: |
Title: | FAST-ON*: AN EXTENDED ALGORITHM FOR
GRAPH ISOMORPHISM PROBLEM AND GRAPH
QUERY PROCESSING |
Authors: | Mosab Hassaan and Karam Gouda |
Year: | 2012 |
Keywords: | Not Available |
Journal: | Not Available |
Volume: | Not Available |
Issue: | Not Available |
Pages: | Not Available |
Publisher: | Not Available |
Local/International: | International |
Paper Link: | Not Available |
Full paper | Mosab abd el-hameed mohamed hassaan_Mosab-Karam-ijdms_journal.pdf |
Supplementary materials | Not Available |
Abstract: |
Graphs are widely used to model complicated data semantics in many applications. In our paper [8], we proposed Fast-ON, an efficient algorithm for subgraph isomorphism problem. In this paper, we develop an efficient algorithm called Fast-ON* that extends Fast-ON to handle two other problems, namely, graph isomorphism problem and graph query processing. Our performance study shows that Fast-ON* outperforms previously proposed algorithms of the two problems with a wide margin. |