729 search results - page 11 / 146 » Solving subgraph isomorphism problems with constraint progra... |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
DAM
2010
14 years 9 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
WSC
2004
14 years 10 months ago
2004
Recently, simulation-based methods have been successfully used for solving challenging stochastic optimization problems and equilibrium models. Here we report some of the recent p...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...