# Has anyone implemented a recognition algorithm for totally unimodular matrices?

One of the consequences of Seymour's characterization of regular matroids is the existence of a polynomial time recognition algorithm for totally unimodular matrices (i.e. matrices for which every square sub-determinant is in {0, 1, -1}).

But has anyone actually implemented it?

• I guess I'll take the silence as a probable "no"... It seems like something that I would like to have done, but don't actually want to do.. Jun 8, 2010 at 1:59