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