A bidirected generalization of network matrices

Authors:
Gautam Appa;Balázs Kotnyek
Affiliations:
London School of Economics, Houghton Street, London WC2A 2AE, UK;London School of Economics, Houghton Street, London WC2A 2AE, UK
Venue:
Networks
Year:
2006

Citing 0
Cited 4

The number of nowhere-zero flows on graphs and signed graphs

Journal of Combinatorial Theory Series B
Ab initio whole genome shotgun assembly with mated short reads

RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Optimization with binet matrices

Operations Research Letters
Recognition algorithms for binary signed-graphic matroids

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.02

Visualization

Abstract

We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the same way as network matrices do from directed graphs. We develop the necessary theory, give binet representations for interesting sets of matrices, characterize totally unimodular binet matrices and discuss the recognition problem. We also prove that binet constraint matrices guarantee half-integral optimal solutions to linear programs. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(4), 185–198 2006