Search Results for ""
281 - 290 of 1848 for Shortest path problemSearch Results
Find the tunnel between two points A and B on a gravitating sphere which gives the shortest transit time under the force of gravity. Assume the sphere to be nonrotating, of ...
A branch of mathematics that is a sort of generalization of calculus. Calculus of variations seeks to find the path, curve, surface, etc., for which a given function has a ...
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 ...
In the case of a general surface, the distance between two points measured along the surface is known as a geodesic. For example, the shortest distance between two points on ...
Stadium billiards refers to the investigation of the path of a billiard ball on a stadium-shaped billiard table, as first investigated by Bunimovich (1974).
The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...
A perfect cuboid is a cuboid having integer side lengths, integer face diagonals d_(ab) = sqrt(a^2+b^2) (1) d_(ac) = sqrt(a^2+c^2) (2) d_(bc) = sqrt(b^2+c^2), (3) and an ...
Let L(n,d) be the smallest tour length for n points in a d-D hypercube. Then there exists a smallest constant alpha(d) such that for all optimal tours in the hypercube, lim ...
The girth of a graphs is the length of one of its (if any) shortest graph cycles. Acyclic graphs are considered to have infinite girth (Skiena 1990, p. 191). The girth of a ...
Given two intersecting lines OA and OB forming an angle with vertex at O and a point X inside the angle ∠AOB, the Philo line (or Philon line) is the shortest line segment AB ...
...
View search results from all Wolfram sites (161941 matches)

