Search Results for ""

Jacobi theta functions can be used to uniformize all elliptic curves. Jacobi elliptic functions may also be used to uniformize some hyperelliptic curves, although only two ...

Two geometric figures are said to be concentric if their centers coincide. The region between two concentric circles is called an annulus. The following table summarizes some ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). An augmenting path for a ...

An automorphic function f(z) of a complex variable z is one which is analytic (except for poles) in a domain D and which is invariant under a countably infinite group of ...

y=x(dy)/(dx)+f((dy)/(dx)) (1) or y=px+f(p), (2) where f is a function of one variable and p=dy/dx. The general solution is y=cx+f(c). (3) The singular solution envelopes are ...

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...

A finitely generated discontinuous group of linear fractional transformations z->(az+b)/(cz+d) acting on a domain in the complex plane. The Apollonian gasket corresponds to a ...

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution 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) ...