Search Results for ""

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

The bandwidth of a matrix M=(m_(ij)) is the maximum value of |i-j| such that m_(ij) is nonzero.

If it is possible to transform a coordinate system to a form where the metric elements g_(munu) are constants independent of x^mu, then the space is flat.

The conjecture that the maximum local density is given by rho_(dodecahedron).

A robust estimation based on maximum likelihood arguments.

The apodization function A(x)=cos((pix)/(2a)). Its full width at half maximum is 4a/3. Its instrument function is I(k)=(4acos(2piak))/(pi(1-16a^2k^2)), which has a maximum of ...

An extremum is a maximum or minimum. An extremum may be local (a.k.a. a relative extremum; an extremum in a given region which is not the overall maximum or minimum) or ...

A loose term for a true statement which may be a postulate, theorem, etc.

A local extremum, also called a relative extremum, is a local minimum or local maximum.

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...