Search Results for ""

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

Let f:M->N be a geodesic mapping. If either M or N has constant curvature, then both surfaces have constant curvature (Ambartzumian 1982, p. 26; Kreyszig 1991).

The bend of a circle C mutually tangent to three other circles is defined as the signed curvature of C. If the contacts are all external, the signs of the bends of all four ...

A knot used to join the ends of two ropes together to form a longer length.

A matching is a maximum matching iff it contains no augmenting path.

There are two definitions of Bernoulli polynomials in use. The nth Bernoulli polynomial is denoted here by B_n(x) (Abramowitz and Stegun 1972), and the archaic form of the ...

An experiment in which s trials are made of an event, with probability p of success in any given trial.

If a minimal surface is given by the equation z=f(x,y) and f has continuous first and second partial derivatives for all real x and y, then f is a plane.

If g(theta) is a trigonometric polynomial of degree m satisfying the condition |g(theta)|<=1 where theta is arbitrary and real, then g^'(theta)<=m.

The general curve of a system which is linearly dependent on a certain number of given irreducible curves will not have a singular point which is not fixed for all the curves ...