Application of Constraint Programming in Subgragh Isomorphism Problem, M.Sc. Thesis Sharif University of Technology ; Eshghi, Kourosh (Supervisor)
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... Cataloging briefApplication of Constraint Programming in Subgragh Isomorphism Problem, M.Sc. Thesis Sharif University of Technology ; Eshghi, Kourosh (Supervisor)
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... Find in contentBookmark |
|