Mosab abd el-hameed mohamed hassaan
Lecturer
A Fast Algorithm for Subgraph Search Problem
INFOS conference • 2012
Publication Information
Authors
Karam Gouda; Mosab Hassaan
Keywords
Not Available
Journal
INFOS conference
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 this paper we propose
Fast-ON, an efficient algorithm for subgraph isomorphism
problem which has proven to be NP-complete.
Fast-ON is based on Ullman algorithm [8]. It improves
the search space of Ullman algorithm by considering two
effective optimizations. Comparing to the well-known algorithms
Ullman and Vflib [3], Fast-ON achieves up to 1-3
orders of magnitude speed-up.
in many applications. In this paper we propose
Fast-ON, an efficient algorithm for subgraph isomorphism
problem which has proven to be NP-complete.
Fast-ON is based on Ullman algorithm [8]. It improves
the search space of Ullman algorithm by considering two
effective optimizations. Comparing to the well-known algorithms
Ullman and Vflib [3], Fast-ON achieves up to 1-3
orders of magnitude speed-up.