Computing DM-decomposition of a partitioned matrix with rank-1 blocks
classification
🧮 math.CO
keywords
matrixpartitionedalgorithmblockscomputecomputingdecompositiondevelop
read the original abstract
In this paper, we develop a polynomial time algorithm to compute a Dulmage-Mendelsohn-type decomposition of a matrix partitioned into submatrices of rank at most $1$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.