Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs
From MaRDI portal
Publication:1978718
DOI10.1016/S0304-3975(99)00203-0zbMath0938.68061OpenAlexW2068915541MaRDI QIDQ1978718
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00203-0
Cites Work
- Unnamed Item
- Perfect \(0,\pm 1\) matrices
- Star-cutsets and perfect graphs
- The ellipsoid method and its consequences in combinatorial optimization
- Geometric algorithms and combinatorial optimization
- Binary integer programs with two variables per inequality
- On certain polytopes associated with graphs
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Normal hypergraphs and the perfect graph conjecture
- Perfect and Ideal 0, ±1 Matrices
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS
- Perfect zero–one matrices
This page was built for publication: Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs