96 search results - page 13 / 20 » New Plain-Exponential Time Classes for Graph Homomorphism |
JCT
2010
14 years 8 months ago
2010
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
DBPL
1993
Springer
15 years 1 months ago
1993
Springer
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments , an object-oriented data model at the core of a scient...
ESA
1997
Springer
15 years 1 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
107
Voted
ACTA
2007
14 years 9 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
ATMOS
2010
14 years 8 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...