Skip to main content
MathOverflow

Return to Answer

replaced http://mathoverflow.net/ with https://mathoverflow.net/
Source Link
Community Bot
Community Bot
  • 1
  • 2
  • 3

Seymour's decomposition theorem for regular matroids yields a polynomial-time algorithm for testing if any {0,1,-1} matrix is totally unimodular. Unfortunately, due to the sound of paint drying on this questionquestion of Gordon Royle, it seems as if no one has yet implemented it.

Seymour's decomposition theorem for regular matroids yields a polynomial-time algorithm for testing if any {0,1,-1} matrix is totally unimodular. Unfortunately, due to the sound of paint drying on this question of Gordon Royle, it seems as if no one has yet implemented it.

Seymour's decomposition theorem for regular matroids yields a polynomial-time algorithm for testing if any {0,1,-1} matrix is totally unimodular. Unfortunately, due to the sound of paint drying on this question of Gordon Royle, it seems as if no one has yet implemented it.

Source Link
Tony Huynh
Tony Huynh
  • 32.1k
  • 11
  • 112
  • 187

Seymour's decomposition theorem for regular matroids yields a polynomial-time algorithm for testing if any {0,1,-1} matrix is totally unimodular. Unfortunately, due to the sound of paint drying on this question of Gordon Royle, it seems as if no one has yet implemented it.