TOPICS
Search

Search Results for ""


421 - 430 of 1848 for Shortest path problemSearch Results
A solution to a problem that can be written in "closed form" in terms of known functions, constants, etc., is often called an analytic solution. Note that this use of the ...
As used in physics, the term "exact" generally refers to a solution that captures the entire physics and mathematics of a problem as opposed to one that is approximate, ...
The discontinuous solution of the surface of revolution area minimization problem for surfaces connecting two circles. When the circles are sufficiently far apart, the usual ...
The branch of algebraic topology which deals with homotopy groups. Homotopy methods can be used to solve systems of polynomials by embedding the polynomials in a family of ...
The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...
Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...
A Z-number is a real number xi such that 0<=frac[(3/2)^kxi]<1/2 for all k=1, 2, ..., where frac(x) is the fractional part of x. Mahler (1968) showed that there is at most one ...
Many authors (e.g., Mendelson 1963; Pervin 1964) use the term arcwise-connected as a synonym for pathwise-connected. Other authors (e.g., Armstrong 1983; Cullen 1968; and ...
A curtate cycloid, sometimes also called a contracted cycloid, is the path traced out by a fixed point at a radius b<a, where a is the radius of a rolling circle. Curtate ...
A fan graph F_(m,n) is defined as the graph join K^__m+P_n, where K^__m is the empty graph on m nodes and P_n is the path graph on n nodes. The case m=1 corresponds to the ...
1 ... 40|41|42|43|44|45|46 ... 185 Previous Next

...