Pages that link to "Item:Q5487821"
From MaRDI portal
The following pages link to A simple algorithm that proves half‐integrality of bidirected network programming (Q5487821):
Displaying 8 items.
- The number of nowhere-zero flows on graphs and signed graphs (Q859616) (← links)
- On the representability of totally unimodular matrices on bidirected graphs (Q1044979) (← links)
- Conformal decomposition of integral flows on signed graphs with outer-edges (Q2053688) (← links)
- Resolution of indecomposable integral flows on signed graphs (Q2400559) (← links)
- Recognizing binet matrices (Q2638382) (← links)
- Conformal Decomposition of Integral Tensions and Potentials of Signed Graphs (Q4591228) (← links)
- Convergence and Correctness of Max-Product Belief Propagation for Linear Programming (Q5361238) (← links)
- Matroids of gain signed graphs (Q6624166) (← links)
