Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
From MaRDI portal
Publication:1850526
DOI10.1006/jctb.2000.2011zbMath1026.05017MaRDI QIDQ1850526
Ajai Kapoor, Michele Conforti, Kristina Vušković, 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.2011
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05C22: Signed and weighted graphs
Related Items
The strong perfect graph conjecture: 40 years of attempts, and its resolution, Square-free perfect graphs., On some graph classes related to perfect graphs: a survey, Detecting 2-joins faster, A polynomial recognition algorithm for balanced matrices, Linear Balanceable and Subcubic Balanceable Graphs*, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
Cites Work