Computing DM-decomposition of a partitioned matrix with rank-1 blocks (Q1747895): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Admissible Mappings between Dependence Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverings of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Linear Programming for General-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of submodular function minimisation on diamonds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singular spaces of matrices and their application in combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices and matroids for systems analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations / rank
 
Normal rank

Revision as of 13:35, 15 July 2024

scientific article
Language Label Description Also known as
English
Computing DM-decomposition of a partitioned matrix with rank-1 blocks
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references