Search Results for ""

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

The function f(x,y)=(1-x)^2+100(y-x^2)^2 that is often used as a test problem for optimization algorithms (where a variation with 100 replaced by 105 is sometimes used; ...

The transitive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same transitive closure as R. Thus aR^'b for any elements a and b of X, ...

The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

For a particular format in the IEEE 754-2008 framework, a normal number is a finite nonzero floating-point number with magnitude greater than or equal to a minimum value ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

The maximum and minimum of the normal curvature kappa_1 and kappa_2 at a given point on a surface are called the principal curvatures. The principal curvatures measure the ...

An algorithm for partitioning (or clustering) N data points into K disjoint subsets S_j containing N_j data points so as to minimize the sum-of-squares criterion ...

A spiral that gives the solution to the central orbit problem under a radial force law r^..=-mu|r|^(-3)r^^, (1) where mu is a positive constant. There are three solution ...