You are in:Home/Publications/A fast algorithm for subgraph search problem

Prof. karam gouda :: Publications:

A fast algorithm for subgraph search problem
Authors: Karam Gouda · Mosab Hassaan
Year: 2012
Keywords: Not Available
Journal: (INFOS), 2012 8th International Conference on Informatics and Systems
Volume: Not Available
Issue: Not Available
Pages: DE-53 - DE-59
Publisher: IEEE
Local/International: International
Paper Link:
Full paper karam gouda_Infos_SubGraph.pdf
Supplementary materials Not Available

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 [1]. It improves the search space of Ullman algorithm by considering two effective optimizations. Comparing to the well-known algorithms Ullman and Vflib [2], Fast-ON achieves up to 1–3 orders of magnitude speed-up.

Google ScholarAcdemia.eduResearch GateLinkedinFacebookTwitterGoogle PlusYoutubeWordpressInstagramMendeleyZoteroEvernoteORCIDScopus