Search Results for ""

An independent edge set, also called a matching, of a graph G is a subset of the edges such that no two edges in the subset share a vertex in G. A maximum independent edge ...

This problem is NP-complete (Garey and Johnson 1983).

An unknown is an independent variable of a function. A function with n independent variables is said to be a function "in," "with," or "of" n unknowns.

A differential equation or system of ordinary differential equations is said to be autonomous if it does not explicitly contain the independent variable (usually denoted t). ...

A continuous distribution in which the logarithm of a variable has a normal distribution. It is a general case of Gibrat's distribution, to which the log normal distribution ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

A real-valued stochastic process {B(t):t>=0} is a Brownian motion which starts at x in R if the following properties are satisfied: 1. B(0)=x. 2. For all times ...

The natural parametric equations of a curve are parametric equations that represent the curve in terms of a coordinate-independent parameter, generally arc length s, instead ...

The functional equation phi(f(x))=sphi(x), with s!=0,1.

A differential of the form df=P(x,y)dx+Q(x,y)dy (1) is exact (also called a total differential) if intdf is path-independent. This will be true if ...