Search Results for ""

A search algorithm of a tree that explores the first child of a node before visiting its siblings. Tarjan (1972) and Hopcroft and Tarjan (1973) showed that depth-first search ...

Given a polygon with an even number of sides, the derived polygon is obtained by joining the points which are a fractional distance r along each side. If r=1/2, then the ...

Togliatti surfaces are quintic surfaces having the maximum possible number of ordinary double points (31). A related surface sometimes known as the dervish can be defined by ...

The Descartes snarks are a set of snarks on 210 vertices and 315 edges discovered by William Tutte in 1948 writing under the pseudonym Blanche Descartes (Descartes 1948; ...

The total angular defect is the sum of the angular defects over all polyhedron vertices of a polyhedron, where the angular defect delta at a given polyhedron vertex is the ...

The descending chain condition, commonly abbreviated "D.C.C.," is the dual notion of the ascending chain condition. The descending chain condition for a partially ordered set ...

7 7 6 6 3 1; 6 5 4 2 ; 3 3 ; 2 A descending plane partition of order n is a two-dimensional array (possibly empty) of positive integers less than or equal to n such that the ...

Let DeltaA^'B^'C^' be a triangle perspective to a reference triangle DeltaABC with perspector D^(''). Let A^('') be the intersection of lines BC^' and CB^', B^('') the ...

Let Delta_1, Delta_2, and Delta_3 be tetrahedra in projective three-space P^3. Then the tetrahedra are said to be desmically related if there exist constants alpha, beta, and ...

Also known as "Laplacian" determinant expansion by minors, expansion by minors is a technique for computing the determinant of a given square matrix M. Although efficient for ...