By Topic

Decomposition of {0,1}-matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Swaminathan, R. ; Dept. of Comput. Sci., Cincinnati Univ., OH, USA ; Veeramani, D.

A simple decomposition of a r×c{0,1}-matrix is defined in terms of a collection of disjoint submatrices obtained by deleting a “minimal” set of columns. In general, the number of such simple decompositions is Θ(2r). A class of matrices, namely, vertex-tree graphic, is defined, and it is shown that the number of simple decompositions of a vertex-tree graphic matrix is at most r-1. Finally, the relevance of simple decomposition to the well-known problem of cluster formation on {0,1}-matrices is uncovered, and an O(r2 c) time algorithm is given to solve this problem for vertex-tree graphic matrices

Published in:

Computers, IEEE Transactions on  (Volume:43 ,  Issue: 5 )