Search Results for ""

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

Let (a)_i and (b)_i be sequences of complex numbers such that b_j!=b_k for j!=k, and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

Let the characteristic polynomial of an n×n complex matrix A be written in the form P(lambda) = |lambdaI-A| (1) = ...

The Banach density of a set A of integers is defined as lim_(d->infty)max_(n)(|{A intersection [n+1,...,n+d]}|)/d, if the limit exists. If the lim is replaced with lim sup or ...

A basis vector in an n-dimensional vector space is one of any chosen set of n vectors in the space forming a vector basis, i.e., having the property that every vector in the ...

A set of planes sharing a point in common. For planes specified in Hessian normal form, a bundle of planes can therefore be specified as ...

A set of functions {f_1(n,x),f_2(n,x)} is termed a complete biorthogonal system in the closed interval R if, they are biorthogonal, i.e., int_Rf_1(m,x)f_1(n,x)dx = ...

The upper and lower hinges are descriptive statistics of a set of N data values, where N is of the form N=4n+5 with n=0, 1, 2, .... The hinges are obtained by ordering the ...

Let t(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Then if S_m=sum_(t(m))1/t, (1) then {S_m=0 (mod m^2) ...