Search Results for ""

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

A set of four points, one of which is the orthocenter of the other three. In an orthocentric system, each point is the orthocenter of the triangle of the other three, as ...

A problem in game theory first discussed by A. Tucker. Suppose each of two prisoners A and B, who are not allowed to communicate with each other, is offered to be set free if ...

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

A stable isolated (i.e., solitary) traveling nonlinear wave solution to a set of equations that obeys a superposition-like principle (i.e., solitons passing through one ...

Synergetics coordinates are a set of triangular coordinates in their plane (or their generalization to tetrahedral coordinates in space, or the analogs in higher dimensions). ...

A sequence of functions {f_n}, n=1, 2, 3, ... is said to be uniformly convergent to f for a set E of values of x if, for each epsilon>0, an integer N can be found such that ...

Universal algebra studies common properties of all algebraic structures, including groups, rings, fields, lattices, etc. A universal algebra is a pair A=(A,(f_i^A)_(i in I)), ...

A Gröbner basis G for a system of polynomials A is an equivalence system that possesses useful properties, for example, that another polynomial f is a combination of those in ...

A mathematical procedure for finding the best-fitting curve to a given set of points by minimizing the sum of the squares of the offsets ("the residuals") of the points from ...