AbstractIn this paper we propose a lazy constraint imposing mechanism for improving the path constraint in GRASPER, a state-of-the-art graph constraint solver, having obtained very promising results in terms of both time and space in solving an interesting problem in the Biochemistry subject area, in comparison with CP(Graph), the state-of-the-art solver
Abstract. Applying an attributed graph transformation rule to a given object graph always implies so...
The tractability of a Constraint Satisfaction Problem (CSP)is guaranteed by a direct relationship be...
Conventional techniques for the constraint satisfaction problem (CSP) have had considerable success ...
In this paper we propose a lazy constraint imposing mechanism for improving the path constraint in G...
Abstract. In this paper we present GRASPER, a graph constraint solver, based on set constraints, tha...
Constraint programming (CP) aims at modeling and solving constraint satisfaction problems. These pro...
The analysis of biochemical networks is mainly done using relational or procedural languages. Combin...
The analysis of biochemical networks is mainly done using relational or procedural lan-guages. Combi...
In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We p...
In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We pr...
Constrained path problems have to do with finding paths in graphs subject to constraints. We present...
Many IT applications require to solve decision problems which are hard from a mathematical point of ...
Constrained graph problems are about finding graphs respecting a given set of constraints. These pro...
A large number of problems can be formulated as special cases of the Constraint Satisfaction Problem...
Abstract. This paper proposes a GRASP algorithm combined with Path Relinking to solve the SumCut min...
Abstract. Applying an attributed graph transformation rule to a given object graph always implies so...
The tractability of a Constraint Satisfaction Problem (CSP)is guaranteed by a direct relationship be...
Conventional techniques for the constraint satisfaction problem (CSP) have had considerable success ...
In this paper we propose a lazy constraint imposing mechanism for improving the path constraint in G...
Abstract. In this paper we present GRASPER, a graph constraint solver, based on set constraints, tha...
Constraint programming (CP) aims at modeling and solving constraint satisfaction problems. These pro...
The analysis of biochemical networks is mainly done using relational or procedural languages. Combin...
The analysis of biochemical networks is mainly done using relational or procedural lan-guages. Combi...
In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We p...
In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We pr...
Constrained path problems have to do with finding paths in graphs subject to constraints. We present...
Many IT applications require to solve decision problems which are hard from a mathematical point of ...
Constrained graph problems are about finding graphs respecting a given set of constraints. These pro...
A large number of problems can be formulated as special cases of the Constraint Satisfaction Problem...
Abstract. This paper proposes a GRASP algorithm combined with Path Relinking to solve the SumCut min...
Abstract. Applying an attributed graph transformation rule to a given object graph always implies so...
The tractability of a Constraint Satisfaction Problem (CSP)is guaranteed by a direct relationship be...
Conventional techniques for the constraint satisfaction problem (CSP) have had considerable success ...
DOI
Add to ORKG