Search Results for ""

A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...

A maximal independent vertex set of a graph is an independent vertex set that cannot be expanded to another independent vertex set by addition of any vertex in the graph. A ...

A deconvolution algorithm (sometimes abbreviated MEM) which functions by minimizing a smoothness function ("entropy") in an image. Maximum entropy is also called the ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. Given a vertex cover of a graph, all ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

A McNugget number is a positive integer that can be obtained by adding together orders of McDonald's® Chicken McNuggetsTM (prior to consuming any), which originally came in ...

A type of integral containing gamma functions in its integrand. A typical such integral is given by ...

The Mellin transform is the integral transform defined by phi(z) = int_0^inftyt^(z-1)f(t)dt (1) f(t) = 1/(2pii)int_(c-iinfty)^(c+iinfty)t^(-z)phi(z)dz. (2) It is implemented ...

The Menger sponge is a fractal which is the three-dimensional analog of the Sierpiński carpet. The nth iteration of the Menger sponge is implemented in the Wolfram Language ...

The Mercator projection is a map projection that was widely used for navigation since loxodromes are straight lines (although great circles are curved). The following ...