Unimodularity

The Unimodularity Library is a software library written in C++ that implements an efficient algorithm for testing total unimodularity, based on Seymour’s decomposition theorem [1] for regular matroids. The algorithm runs in O( (n+m)^5 ) time and is a simplified version of the cubic algorithm of [2]. The algorithm can also test for the related properties of unimodularity and strong unimodularity.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 5 articles )

Showing results 1 to 5 of 5.
Sorted by year (citations)

  1. Lange, Jan-Hendrik; Pfetsch, Marc E.; Seib, Bianca M.; Tillmann, Andreas M.: Sparse recovery with integrality constraints (2020)
  2. De Loera, Jesús A.; Goaoc, Xavier; Meunier, Frédéric; Mustafa, Nabil H.: The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (2019)
  3. Tillmann, Andreas M.: Computing the spark: mixed-integer programming for the (vector) matroid girth problem (2019)
  4. Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with \textttpolymake (2017)
  5. Walter, Matthias; Truemper, Klaus: Implementation of a unimodularity test (2013)