Staff Members - Benha University
FAST-ON*: AN EXTENDED ALGORITHM FOR GRAPH ISOMORPHISM PROBLEM AND GRAPH QUERY PROCESSING
International Journal of Database Management Systems ( IJDMS ) • 2012
Publication Information
Authors
Mosab Hassaan and Karam Gouda
Keywords
Not Available
Journal
International Journal of Database Management Systems ( IJDMS )
Publisher
Not Available
Volume
4
Issue
6
Pages
11-25
publication.type
International
Paper Link
Open Link
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.
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.