A constraint programming approach to subgraph isomorphism
This thesis proposes an expressive yet efficient declarative framework for graph matching in constraint programming (CP), and focuses on efficient algorithms to solve the subgraph isomorphism problem. The framework is based on graph and map variables, and specific graph morphism constraints. This al...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
Universite catholique de Louvain
2008
|
| Subjects: | |
| Online Access: | http://edoc.bib.ucl.ac.be:81/ETD-db/collection/available/BelnUcetd-06262008-145353/ |