A bidirected generalization of network matrices

DOI10.1002/net.20108zbMath1097.05025OpenAlexW4251187911MaRDI QIDQ5487806

Gautam M. Appa, Balázs Kotnyek

Publication date: 12 September 2006

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20108

zbMATH Keywords

recognition problemlinear programstotal unimodularitybidirected graphsbinet matriceshalf-integrality

Mathematics Subject Classification ID

Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical linear algebra (65F99)

Related Items (12)

On integer programming with bounded determinants ⋮ Recognizing binet matrices ⋮ The number of nowhere-zero flows on graphs and signed graphs ⋮ Resolution of indecomposable integral flows on signed graphs ⋮ On the determinant of the Laplacian matrix of a complex unit gain graph ⋮ Binary signed-graphic matroids: representations and recognition algorithms ⋮ Characterizations of the set of integer points in an integral bisubmodular polyhedron ⋮ Optimization with binet matrices ⋮ A q-queens problem. VI. The bishops' period ⋮ The Chvátal closure of generalized stable sets in bidirected graphs ⋮ On the representability of totally unimodular matrices on bidirected graphs ⋮ On small-depth tree augmentations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orientation of signed graphs

This page was built for publication: A bidirected generalization of network matrices