Balanced \(0,\pm 1\) matrices. I: Decomposition

DOI10.1006/jctb.2000.2010zbMath1026.05016OpenAlexW2005133218MaRDI QIDQ1850525

Ajai Kapoor, Kristina Vušković, Michele Conforti, Cornuéjols, Gérard

Publication date: 10 December 2002

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

Full work available at URL: https://doi.org/10.1006/jctb.2000.2010

zbMATH Keywords

recognition algorithmextended star cutset

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items

Detecting 2-joins faster, Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality, Balanced matrices, Square-free perfect graphs., Computing \(H\)-joins with application to 2-modular decomposition, Solution of three problems of Cornuéjols, Berge-acyclic multilinear 0-1 optimization problems, Even-hole-free graphs part I: Decomposition theorem, Graph minor theory, Combinatorial optimization with 2-joins, A polynomial recognition algorithm for balanced matrices, Recognizing balanceable matrices, Linear Balanceable and Subcubic Balanceable Graphs*, Even-hole-free graphs part II: Recognition algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic satisfiability
• Decomposition of regular matroids
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Decomposition of balanced matrices
• Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
• Compositions for perfect graphs
• Structural properties and recognition of restricted and strongly unimodular matrices
• A Combinatorial Decomposition Theory
• Extended Horn sets in propositional logic
• A class of logic problems solvable by linear programming
• Characterization of Totally Unimodular Matrices
• Balanced matrices