Sciweavers

729 search results - page 3 / 146
» Solving subgraph isomorphism problems with constraint progra...
Sort
View
AAAI
1994
13 years 6 months ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin
IEEEVAST
2010
13 years 4 days ago
Comparing different levels of interaction constraints for deriving visual problem isomorphs
Interaction and manual manipulation have been shown in the cognitive science literature to play a critical role in problem solving. Given different types of interactions or constr...
Wenwen Dou, Caroline Ziemkiewicz, Lane Harrison, D...
CSCLP
2007
Springer
13 years 11 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
EJC
2010
13 years 5 months ago
On graphs isomorphic to their neighbour and non-neighbour sets
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
Przemyslaw Gordinowicz
CPAIOR
2010
Springer
13 years 10 months ago
Solving Connected Subgraph Problems in Wildlife Conservation
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
Bistra N. Dilkina, Carla P. Gomes