On perfect \(0,\pm 1\) matrices

DOI10.1016/S0012-365X(96)00163-XzbMath0872.90103OpenAlexW1869946094WikidataQ59560845 ScholiaQ59560845MaRDI QIDQ1356731

Ondřej Čepek, Endre Boros

Publication date: 10 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00163-x

zbMATH Keywords

associated perfect graphgeneralized set packing polytopeperfect \(0\), \(\pm 1\) matrices

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

Balanced matrices

Cites Work

• Unnamed Item
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Recognition of \(q\)-Horn formulae in linear time
• Polynomial-time inference of all valid implications for Horn and related formulae
• On certain polytopes associated with graphs
• Anti-blocking polyhedra
• Normal hypergraphs and the perfect graph conjecture
• A Complexity Index for Satisfiability Problems
• Polyhedral sets having a least element
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: On perfect \(0,\pm 1\) matrices