A simple algorithm that proves half‐integrality of bidirected network programming
From MaRDI portal
Recommendations
- A bidirected generalization of network matrices
- On the existence of an integral potential in a weighted bidirected graph
- On matrices with the Edmonds-Johnson property arising from bidirected graphs
- Half-integral vertex covers on bipartite bidirected graphs: total dual integrality and cut-rank
- On the representability of totally unimodular matrices on bidirected graphs
Cites work
Cited in
(12)- On the representability of totally unimodular matrices on bidirected graphs
- Conformal decomposition of integral flows on signed graphs with outer-edges
- Resolution of indecomposable integral flows on signed graphs
- Recognizing binet matrices
- Conformal decomposition of integral tensions and potentials of signed graphs
- Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
- A bidirected generalization of network matrices
- Matroids of gain signed graphs
- A mathematical programming approach for recognizing binet matrices
- On the foundations of signed graphs. I: Chain groups, frame matroid, and bivariate flow polynomial
- On the existence of an integral potential in a weighted bidirected graph
- The number of nowhere-zero flows on graphs and signed graphs
This page was built for publication: A simple algorithm that proves half‐integrality of bidirected network programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487821)