A polynomial recognition algorithm for balanced matrices

DOI10.1016/J.JCTB.2005.02.006zbMATH Open1071.05019OpenAlexW2160639448MaRDI QIDQ2565686FDOQ2565686

Authors: Giacomo Zambelli 

Publication date: 28 September 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.02.006

Recommendations

• scientific article; zbMATH DE number 1003240
• Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
• scientific article; zbMATH DE number 30950
• Recognizing balanceable matrices
• Balanced matrices

zbMATH Keywords

signed bipartite graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Signed and weighted graphs (05C22)

Cites Work

• Decomposition of regular matroids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposition of balanced matrices
• Balanced matrices
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
• Even-hole-free graphs. I: Decomposition theorem
• Even-hole-free graphs part II: Recognition algorithm
• Balanced \(0,\pm 1\) matrices. I: Decomposition
• Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
• Properties of balanced and perfect matrices
• Structural properties and decomposition of linear balanced matrices
• Testing balancedness and perfection of linear matrices
• Balanced \(0,\pm 1\) matrices. II: Recognition algorithm

Cited In (15)

• An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs
• Title not available (Why is that?)
• Properties of balanced and perfect matrices
• On minimal forbidden subgraph characterizations of balanced graphs
• On some graph classes related to perfect graphs: a survey
• Recognizing balanceable matrices
• Balanced matrices
• Balanced State Representations with Polynomial Algebra
• Probe Matrix Problems: Totally Balanced Matrices
• Quasi balanced matrices — An addendum
• On the construction of balanced matrices
• On minimal forbidden subgraph characterizations of balanced graphs
• Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
• Clique-perfectness and balancedness of some graph classes
• On balanced graphs

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)