Perfect (0, 1)-matrices and perfect bidirected graphs
From MaRDI portal
Publication:1978718
DOI10.1016/S0304-3975(99)00203-0zbMATH Open0938.68061OpenAlexW2068915541MaRDI QIDQ1978718FDOQ1978718
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
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Normal hypergraphs and the perfect graph conjecture
- The ellipsoid method and its consequences in combinatorial optimization
- On certain polytopes associated with graphs
- Perfect zero–one matrices
- Star-cutsets and perfect graphs
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Perfect and ideal \(0, \pm 1\) matrices
- Perfect \(0,\pm 1\) matrices
- Binary integer programs with two variables per inequality
- THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS
Recommendations
- Title not available (Why is that?) 👍 👎
- Matrix partitions of perfect graphs 👍 👎
- Perfect \(0,\pm 1\) matrices 👍 👎
- On perfect \(0,\pm 1\) matrices 👍 👎
- Perfect non-commuting graphs of matrices over chains 👍 👎
- \(\beta\)-perfect graphs 👍 👎
- \(i\gamma(1)\)-perfect graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- Pivots, determinants, and perfect matchings of graphs 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978718)
