Search Results for ""

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 ...

The mathematical study of the likelihood and probability of events occurring based on known information and inferred by taking a limited number of samples. Statistics plays ...

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

For a set S, the span is defined by maxS-minS, where max is the maximum and min is the minimum.

The apodization function A(x)=(1-(x^2)/(a^2))^2. Its full width at half maximum is sqrt(4-2sqrt(2))a. Its instrument function is ...

For what value of x is f(x)=x^(1/x) a maximum? The maximum occurs at x=e, where f^'(x)=x^(-2+1/x)(1-lnx)=0, (1) which is zero at x=e and gives a maximum of ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

Every modular system has a modular system basis consisting of a finite number of polynomials. Stated another way, for every order n there exists a nonsingular curve with the ...

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...