Search Results for ""

The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...

Differential evolution is a stochastic parallel direct search evolution strategy optimization method that is fairly fast and reasonably robust. Differential evolution is ...

The Diffie-Hellman protocol is a method for two computer users to generate a shared private key with which they can then exchange information across an insecure channel. Let ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

A dissection fallacy is an apparent paradox arising when two plane figures with different areas seem to be composed by the same finite set of parts. In order to produce this ...

The dodecadodecahedron is the uniform polyhedron with Maeder index 36 (Maeder 1997), Wenninger index 73 (Wenninger 1989), Coxeter index 45 (Coxeter et al. 1954), and Har'El ...

For a graph G and a subset S of the vertex set V(G), denote by N_G[S] the set of vertices in G which are in S or adjacent to a vertex in S. If N_G[S]=V(G), then S is said to ...

If S_1, S_2, and S_3 are three conics having the property that there is a point X, not on any of the conics, lying on a common chord of each pair of the three conics (with ...

A doubly nonnegative matrix is a real positive semidefinite n×n square matrix with nonnegative entries. Any doubly nonnegative matrix A of order n can be expressed as a Gram ...

A function f(z) is said to be doubly periodic if it has two periods omega_1 and omega_2 whose ratio omega_2/omega_1 is not real. A doubly periodic function that is analytic ...