14158 search results - page 463 / 2832 » Generalized switch-setting problems |
151
click to vote
DM
2002
15 years 6 months ago
2002
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
173
click to vote
INFORMATICALT
2000
15 years 6 months ago
2000
It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand side coefficients. How...
155
click to vote
ENTCS
2002
15 years 6 months ago
2002
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
138
click to vote
PR
2000
15 years 6 months ago
2000
The problem of the independence and completeness of rotation moment invariants is addressed in this paper. First, a general method for constructing invariants of arbitrary orders ...
161
click to vote
APAL
1999
15 years 6 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...