990 search results - page 18 / 198 » Sub-Graphs of Complete Graph |
WADT
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
DM
2008
13 years 7 months ago
2008
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices. If F consists of Hamiltonian cycles, then F is the...
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
GG
2008
Springer
2008
Springer
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation
13 years 8 months ago
An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is semantically correct if for each simulation r...
JUCS
2006
13 years 7 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...