On the representability of totally unimodular matrices on bidirected graphs

DOI10.1016/j.disc.2009.03.010zbMath1182.05120arXiv0901.0885OpenAlexW2012084603MaRDI QIDQ1044979

Balázs Kotnyek, Konstantinos Papalamprou, Gautam M. Appa, Leonidas S. Pitsoulis

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.0885

zbMATH Keywords

matroid decompositionnetwork matricesbidirected graphsbinet matricessigned-graphic matroids

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

\(k\)-sum decomposition of strongly unimodular matrices ⋮ Signed analogue of general Kotzig-Lovász decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of regular matroids
• Signed graphs
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• On cographic matroids and signed-graphic matroids
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Converting Linear Programs to Network Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A bidirected generalization of network matrices
• A simple algorithm that proves half‐integrality of bidirected network programming

This page was built for publication: On the representability of totally unimodular matrices on bidirected graphs