Search Results for ""

The problem of finding the strategy to guarantee reaching the boundary of a given region ("forest") in the shortest distance (i.e., a strategy having the best worst-case ...

An algorithm for finding roots which retains that prior estimate for which the function value has opposite sign from the function value at the current best estimate of the ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

The outer Soddy center (or outer Soddy point) is the center of the outer Soddy circle. It is equivalent to the isoperimetric point X_(176) (Kimberling 1994) and has ...

A parallelohedron is a space-filling polyhedron that fills space using an infinite number of similarly situated copies (Tutton 1964, pp. 567 and 723; Coxeter 1973, pp. ...

The path graph P_n is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of ...

The pentatope graph is the skeleton of the pentatope, namely the complete graph K_5. It is sometimes also known as the Kuratowski graph (Nikolić et al. 2000, p. 281). Since ...

A class of map projections in which the parallels are represented by a system of non-concentric circular arcs with centers lying on the straight line representing the central ...

Pong Hau K'i is an ancient Chinese tic-tac-toe-like game involving two players with two differently colored stones (say, red and blue). The players move their respective ...

Let C be a curve and let O be a fixed point. Let P be on C and let Q be the curvature center at P. Let P_1 be the point with P_1O a line segment parallel and of equal length ...