Learn More
Given a set of m observations on n variables, an 0(mn 2) algorithm is proposed to find a basis of all affine relations between these variables satisfied by the observations. On a 25 variables example, this new algorithm is 130 000 times faster than the "all subsets" option for linear regression of the SAS package which is a non polynomial alternative.(More)
An edge-coloring of a graph G1⁄4 ðV ; EÞ is a function c that assigns an integer c(e) (called color) in f 0;1;2;...g to every edge eAE so that adjacent edges are assigned different colors. An edge-coloring is compact if the colors of the edges incident to every vertex form a set of consecutive integers. The deficiency problem is to determine the minimum(More)