Accession Number : AD0430437


Title :   MINIMAL INTERCHANGES OF (0,1)-MATRICES AND DISJOINT CIRCUITS IN A GRAPH


Corporate Author : BOEING SCIENTIFIC RESEARCH LABS SEATTLE WA


Personal Author(s) : Walkup, David W


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/430437.pdf


Report Date : Sep 1963


Pagination or Media Count : 18


Abstract : It is shown that the minimal number of interchanges necessary to transform one (0,1)-matrix into another equivalent one may be computed from the maximal number of edge-disjoint circuits in a bipartite graph derived from the difference of the matrices. This partially answers a question raised by Ryser. Two (0,1)-matrices are said to be equivalent if their difference has zero row and column sums. They are said to differ by an interchange if they are equivalent and their difference is zero except for a 2x2 minor.


Descriptors :   *MATRICES(MATHEMATICS) , COMBINATORIAL ANALYSIS , NETWORKS


Subject Categories : Numerical Mathematics


Distribution Statement : APPROVED FOR PUBLIC RELEASE