Search Results for ""
1711 - 1720 of 2322 for Intersection_graphSearch Results
The Reuleaux tetrahedron, sometimes also called the spherical tetrahedron, is the three-dimensional solid common to four spheres of equal radius placed so that the center of ...
The geometric centroid (center of mass) of the polygon vertices of a triangle is the point G (sometimes also denoted M) which is also the intersection of the triangle's three ...
The 57-cell, also called the pentacontaheptachoron, is a regular self-dual locally projective polytope with 57 hemidodecahedral facets described by Coxeter (1982) and also ...
The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly. When an ant ...
A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...
The cubitruncated cuboctahedron (called the cubotruncated cuboctahedron by Wenninger 1971, p. 121) is the uniform polyhedron with Maeder index 16 (Maeder 1997), Wenninger ...
Let j_k(alpha) denote the number of cycles of length k for a permutation alpha expressed as a product of disjoint cycles. The cycle index Z(X) of a permutation group X of ...
In continuum theory, a dendrite is a locally connected continuum that contains no simple closed curve. A semicircle is therefore a dendrite, while a triangle is not. The term ...
The term discrete percolation is used to describe models of percolation theory whose media are discrete sets like sets of regular lattice points (e.g., bond percolation and ...
The disk model is the standard Boolean-Poisson model in two-dimensional continuum percolation theory. In particular, the disk model is characterized by the existence of a ...
...
View search results from all Wolfram sites (15241 matches)

