A simple algorithm that proves half-integrality of bidirected network programming

In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any column basis, through a simplification, based on an idea of Bolker, of a combinatorial algorithm of Appa and Kotnyek. Corollaries are that the inverse of each nonsingular square submatrix has entries 0,

• Type: Journal
• Year: 2006
• Where: NETWORKS
• Authors: Ethan D. Bolker, Thomas Zaslavsky
• Keywords: Bidirected Graphs, Column, Computer Networks, Incidence Matrix, NETWORKS 2006