Search Results for ""

This problem is NP-complete (Garey and Johnson 1983).

A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...

Midpoint augmentation, a term introduced here, is a variant of conventional augmentation in which each facial polygon is replaced by a triangular polygon joining vertices ...

The radius rho of the midsphere of a polyhedron, also called the interradius. Let P be a point on the original polyhedron and P^' the corresponding point P on the dual. Then ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...

The geometric centroid of the first Morley triangle, which is also the center of Morley's circle, is called the first Morley center. It has triangle center function ...

"Neighborhood" is a word with many different levels of meaning in mathematics. One of the most general concepts of a neighborhood of a point x in R^n (also called an ...

Beautiful patterns can be created by drawing sets of nested polygons such that the incircle of the nth polygon is the circumcircle of the (n+1)st and successive polygons are ...

A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).