Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Incidence matrix 15 found (67 total)

alternate case: incidence matrix

Birkhoff interpolation (1,628 words) [view diff] exact match in snippet view article find links to article

\forall (i,j)/e_{ij}=1} The matrix E {\displaystyle E} is called the incidence matrix. For example, the incidence matrices for the interpolation problems
Design structure matrix (1,635 words) [view diff] exact match in snippet view article find links to article
structure method, dependency source matrix, problem solving matrix (PSM), incidence matrix, N2 matrix, interaction matrix, dependency map or design precedence
Fisher's inequality (512 words) [view diff] exact match in snippet view article find links to article
exactly r blocks. Fisher's inequality states simply that b ≥ v. Let the incidence matrix M be a v × b matrix defined so that Mi,j is 1 if element i is in block
90 (number) (2,028 words) [view diff] exact match in snippet view article
Witting polytope in four-dimensional complex space. By Coxeter, the incidence matrix configuration of the Witting polytope can be represented as: [ 40 9
Maria Hasse (594 words) [view diff] exact match in snippet view article find links to article
coloring of vertices of a graph by means of Boolean powers of the incidence matrix]", Doklady Akademii Nauk SSSR (in Russian), 147: 758–759, MR 0145509
List of NP-complete problems (2,746 words) [view diff] exact match in snippet view article find links to article
called "minimum cover" problem). This is equivalent, by transposing the incidence matrix, to the hitting set problem.: SP5, SP8  Set packing: SP3  Set splitting
Gallai–Hasse–Roy–Vitaver theorem (1,754 words) [view diff] exact match in snippet view article find links to article
coloring of vertices of a graph by means of Boolean powers of the incidence matrix]", Doklady Akademii Nauk SSSR (in Russian), 147: 758–759, MR 0145509
Alan J. Hoffman (3,693 words) [view diff] exact match in snippet view article find links to article
many more, including exploring properties of the edge versus path incidence matrix of series parallel graphs (related to greedy packings) with Schieber
Signed graph (3,249 words) [view diff] exact match in snippet view article find links to article
as balanced components. This matroid is the column matroid of the incidence matrix of the signed graph. That is why it describes the linear dependencies
Line graph (5,360 words) [view diff] exact match in snippet view article find links to article
I {\displaystyle A=J^{\mathsf {T}}J-2I} , where J is the signless incidence matrix of the pre-line graph and I is the identity. In particular, A + 2I
Wai-Kai Chen (1,510 words) [view diff] exact match in snippet view article find links to article
1080/00207216908900046. —— (1970). "On the nonsingular submatrices of the incidence matrix of a graph over the real field". Journal of the Franklin Institute
Hadamard's maximal determinant problem (2,429 words) [view diff] exact match in snippet view article find links to article
13 3645 Attains Barba bound; maximal-determinant matrix is {1,−1} incidence matrix of projective plane of order 3 14 9477 Attains Ehlich–Wojtas bound
Attribute hierarchy method (6,762 words) [view diff] exact match in snippet view article find links to article
connection with A4. The potential pool of items is represented by the incidence matrix (Q) matrix of order (k, p), where k is the number of attributes and
Perfect graph (7,055 words) [view diff] exact match in snippet view article find links to article
removal of irrelevant "dominated" rows) the maximal clique versus vertex incidence matrix of a perfect graph. This matrix has a column for each vertex of the
Depth of noncommutative subrings (2,993 words) [view diff] exact match in snippet view article find links to article
(using a 1967 theorem of Rieffel). If M is the inclusion matrix (or incidence matrix of the Bratteli diagram) of finite-dimensional semisimple (complex)