: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...
We describe the implementation of the shearingbox approach into the Godunovtype central-upwind/constraint-transport magnetohydrodynamics code NIRVANA. This will allow for applicat...
Simulation of biomembranes over length and time scales relevant to cellular biology is not currently feasible with molecular dynamics including full atomic detail. Barring an unfo...