ISSN:
1436-4646
Keywords:
Perfect matrices
;
balanced matrices
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract In this paper we define wheel matrices and characterize some properties of matrices that are perfect but not balanced. A consequence of our results is that if a matrixA is perfect then we can construct a polynomial number of submatricesA I,⋯,A n ofA such thatA is balanced if and only if all the submatricesA 1,⋯,A n ofA are perfect. This implies that if the problem of testing perfection is polynomially solvable, then so is the problem of testing balancedness.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01581189
Permalink