We determine all values of k for which every simple r -regular graph of order n and with edge-connectivity λ has a k -factor for which there exists a maximal set of m edge-disjoint k -factors.Expand

We developed the DataMiningGrid system, a grid computing framework for data mining applications that integrates a diverse set of programs and application scenarios within a single framework.Expand

Let G = (V, E) be a graph and let k be a nonnegative integer. A vector c e ℤ V+ is called k-colorable iff there exists a coloring of G with k colors that assigns exactly c(v) colors to vertex v e V.… Expand

BackgroundDue to the unique neural projections of the olfactory system, odours have the ability to directly influence affective processes. Furthermore, it has been shown that emotional states can… Expand

The shift towards intrinsically distributed complex problem solving environments is prompting a need for new systems, which utilize the virtually unlimited data and computational resources of the Grid and at the same time hide all the related complexity from the user.Expand