Sciweavers

4066 search results - page 211 / 814
» Almost Complete Sets
Sort
View
DM
2008
85views more  DM 2008»
15 years 6 months ago
All graphs with maximum degree three whose complements have 4-cycle decompositions
Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is compl...
Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, T...
AML
2006
49views more  AML 2006»
15 years 6 months ago
No Escape from Vardanyan's theorem
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
Albert Visser, Maartje de Jonge
APAL
2006
89views more  APAL 2006»
15 years 6 months ago
On modal logic of deductive closure
A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be dec...
Pavel Naumov
EOR
2008
85views more  EOR 2008»
15 years 6 months ago
The Linear Ordering Problem with cumulative costs
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...
Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti
JSC
2008
72views more  JSC 2008»
15 years 6 months ago
Flat matching
Abstract. Flat theory with sequence variables and flexible arity symbols has infinitary matching and unification type. Decidability of general unification is shown and a unificatio...
Temur Kutsia