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  for regular matroids. The algorithm runs in O( (n+m)^5 ) time and is a simplified version of the cubic algorithm of . The algorithm can also test for the related properties of unimodularity and strong unimodularity.
Keywords for this software
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with \textttpolymake (2017)
- Walter, Matthias; Truemper, Klaus: Implementation of a unimodularity test (2013)