Search Results for ""
631 - 640 of 1833 for Disk_covering_problemSearch Results
Consider three mutually tangent circles, and draw their inner Soddy circle. Then draw the inner Soddy circles of this circle with each pair of the original three, and ...
In the field of percolation theory, the term percolation threshold is used to denote the probability which "marks the arrival" (Grimmett 1999) of an infinite connected ...
Given a simplex of unit content in Euclidean d-space, pick n>=d+1 points uniformly and independently at random, and denote the expected content of their convex hull by ...
A sheaf is a presheaf with "something" added allowing us to define things locally. This task is forbidden for presheaves in general. Specifically, a presheaf F on a ...
A space D is connected if any two points in D can be connected by a curve lying wholly within D. A space is 0-connected (a.k.a. pathwise-connected) if every map from a ...
A double bubble is pair of bubbles which intersect and are separated by a membrane bounded by the intersection. The usual double bubble is illustrated in the left figure ...
The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...
A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...
A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...
Discrete group theory is a broad subject covering certain aspects of groups. Such topics as free groups, group presentations, fundamental groups, Kleinian groups, and ...
...
View search results from all Wolfram sites (161691 matches)

