A decomposition theory for matroids. V: Testing of matrix total unimodularity

DOI10.1016/0095-8956(90)90030-4zbMath0646.05014OpenAlexW1992996900MaRDI QIDQ1103625

Klaus Truemper

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90030-4

zbMATH Keywords

decompositionmatroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Notes on \(\{a,b,c\}\)-modular matrices, Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix, A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem, Signed-graphic matroids with all-graphic cocircuits, Binary signed-graphic matroids: representations and recognition algorithms, Counting vertices of integral polytopes defined by facets, Sparse recovery with integrality constraints, Implementation of a unimodularity test, A decomposition theory for matroids. VI: Almost regular matroids, Computing the spark: mixed-integer programming for the (vector) matroid girth problem, A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid, On the recognition of \(\{a,b,c\}\)-modular matrices, On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes), Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces

Cites Work

• Unnamed Item
• Decomposition of regular matroids
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• On the efficiency of representability tests for matroids
• Partial matroid representations
• A decomposition theory for matroids. IV: Decomposition of graphs
• On matroid separations of graphs
• A Combinatorial Decomposition Theory
• On Whitney's 2‐isomorphism theorem for graphs
• Connectivity in Matroids