A polynomial recognition algorithm for balanced matrices
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 3327126 (Why is no real title available?)
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Balanced matrices
- Decomposition of balanced matrices
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
- Decomposition of regular matroids
- Even-hole-free graphs part II: Recognition algorithm
- Even-hole-free graphs. I: Decomposition theorem
- Properties of balanced and perfect matrices
- Structural properties and decomposition of linear balanced matrices
- Testing balancedness and perfection of linear matrices
Cited in
(15)- Recognizing balanceable matrices
- On some graph classes related to perfect graphs: a survey
- Balanced State Representations with Polynomial Algebra
- On minimal forbidden subgraph characterizations of balanced graphs
- scientific article; zbMATH DE number 7376020 (Why is no real title available?)
- Quasi balanced matrices — An addendum
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
- On minimal forbidden subgraph characterizations of balanced graphs
- Clique-perfectness and balancedness of some graph classes
- On balanced graphs
- Probe Matrix Problems: Totally Balanced Matrices
- Balanced matrices
- On the construction of balanced matrices
- An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs
- Properties of balanced and perfect matrices
This page was built for publication: A polynomial recognition algorithm for balanced matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565686)
