Search Results for ""

A plane shape constructed by Reinhardt (1934) that is conjectured to be the "worst" packer of all centrally-symmetric plane regions. It has a packing density of ...

The theory of analyzing a decision between a collection of alternatives made by a collection of n voters with separate opinions. Any choice for the entire group should ...

A self-organizing data structure which uses rotations to move any accessed key to the root. This leaves recently accessed nodes near the top of the tree, making them very ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

WireWorld is a two-dimensional four-color cellular automaton introduced by Brian Silverman in 1987. The rule for the automaton uses the cell's old value a together with the ...

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...