Application of Constraint Programming in Subgragh Isomorphism Problem

Please enable javascript in your browser.

Hosseini, Leila | 2013

697 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 44661 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Eshghi, Kourosh
Abstract:
Subgraph isomorphism problem is an NP-complete problem, which has diverse applications in different fields such as network problems, image processing, text processing, topography, and bioinformatics. Therefore, many researchers from both theoretical and practical viewpoints have considered it. In this research, we try to offer a proper and efficient method to solve this problem by using constraint programming, which is a powerful and efficient method to model and solve complicated combinatorial optimization problems, and criticality and cruciality concepts from a resource planning scope.
In this regard, first one of the most efficient models among existing constraint programming models of subgraph isomorphism problem has been chosen, then it has been modified by two rules: the most-constrained strategy and the least impact strategy. These rules have been applied in search phase for variable and value ordering. The comparison between proposed method and primary method indicated that by using criticality and cruciality concepts, the efficiency of solution increased by traversing less nodes in search tree
Keywords:
Subgraph Isomorphism ; Amplitude Reduction ; Constraint Programming ; Search Phase ; Constraint Propagation

No TOC