Testing balancedness and perfection of linear matrices
From MaRDI portal
Publication:689142
DOI10.1007/BF01582135zbMATH Open0788.90062OpenAlexW2061781976MaRDI QIDQ689142FDOQ689142
Publication date: 30 May 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582135
Recommendations
- Properties of balanced and perfect matrices
- Perfect, ideal and balanced matrices
- Structural properties and decomposition of linear balanced matrices
- Testing of matrix properties
- Balanced matrices
- Balanced matrices
- Recognizing balanceable matrices
- On the construction of balanced matrices
- scientific article; zbMATH DE number 770091
- Testing some properties of real matrices
decompositionbipartite graphspolynomial algorithmsbalanced matrixauction algorithmtesting algorithmsalgorithmic verificationlinear matrixperfect matrixset packing polytope
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On certain polytopes associated with graphs
- Perfect zero–one matrices
- Balanced matrices
- An algorithm for finding clique cut-sets
- Structural properties and recognition of restricted and strongly unimodular matrices
- Properties of balanced and perfect matrices
- Structural properties and decomposition of linear balanced matrices
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- Articulation sets in linear perfect matrices. II: The wheel theorem and clique articulations
- Odd cycles and matrices with integrality properties
- On a Class of Totally Unimodular Matrices
- The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs
Cited In (10)
- Perfect, ideal and balanced matrices
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- Properties of balanced and perfect matrices
- Structural properties and decomposition of linear balanced matrices
- Balanced matrices
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Decomposition of balanced matrices
- Title not available (Why is that?)
- A polynomial recognition algorithm for balanced matrices
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
This page was built for publication: Testing balancedness and perfection of linear matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689142)
