Search Results for ""

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

In a given triangle DeltaABC with all angles less than 120 degrees (2pi/3, the first Fermat point X or F_1 (sometimes simply called "the Fermat point," Torricelli point, or ...

A technique used by André (1887) to provide an elegant solution to the ballot problem (Hilton and Pederson 1991) and in study of Wiener processes (Doob 1953; Papoulis 1984, ...

The Bevan point V of a triangle DeltaABC is the circumcenter of the excentral triangle DeltaJ_AJ_BJ_C. It is named in honor of Benjamin Bevan, a relatively unknown Englishman ...

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

The image on the Riemann sphere of any circle under a complex rational mapping with numerator and denominator having degrees no more than n has length no longer than 2npi.

The Riemann's moduli space gives the solution to Riemann's moduli problem, which requires an analytic parameterization of the compact Riemann surfaces in a fixed ...

A plot of y_i versus the estimator e_i=y^^_i-y_i. Random scatter indicates the model is probably good. A pattern indicates a problem with the model. If the spread in e_i ...

Any triangle that has two equal angle bisectors (each measured from a polygon vertex to the opposite sides) is an isosceles triangle. This theorem is also called the ...

In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...