Totally Unimodular Matrices > NP-Incompleteness > Totally Unimodular Matrices

Totally Unimodular Matrices

02 Sep 2012

An unimodular matrix is a square matrix with integer entries such that its determinant is either -1, 0 or 1. A matrix is said totally unimodular (TU for short) if all its square submatrices are unimodular.

Sometime ago, we said that problems such as the minimum path, maximum flow and minimum cost max flow can be modeled using linear programming with the interesting property that the optimal solutions are always integer.

In that post, we also said that it was because the coefficient matrix of the constraints of the formulations are totally unimodular. More formally, we have the following theorem:

Theorem 1. Let \(A\) be a totally unimodular matrix and \(b\) be an integer vector. Then, the polyhedra \(P = \{x \mid Ax \le b\}\) has integer vertices.

In this post we’ll present some properties of TU matrices and discuss about two simple examples.


Let \(A\) be a totally unimodular matrix. Then we have the following properties:

  1. Its transpose, \(A^{T}\), is TU.
  2. The matrix obtained by appending the identity matrix to \(A\), that is \([A, I]\), is TU
  3. Any submatrix of \(A\) is TU
  4. The matrix obtained by multiplying any row of \(A\) by -1 is TU
  5. The matrix obtained by duplicating any row of \(A\) is TU

Using this properties we can get some Corollaries from Theorem 1.

Since \([A, -I]\) is TU, we have the following

Corollary 1. The polytope \(P = \{x \mid Ax \le b; x \ge 0 \}\) has integer vertices.

Also, since \([A^T, -A^T, I, -I]\) is TU,

Corollary 2. The dual of \(P = \{c^Tx \mid Ax \le b; x \ge 0 \}\), namely \(Q = \{b^Ty \mid A^Ty \ge c; y \ge 0\}\) has also integer vertices.


1. Bipartite Graphs

Let \(G = (V, E)\) be an undirected graph and \(M\) the incidence matrix of \(G\). That is, a binary matrix where each line corresponds to a vertex \(v\) and each column to an edge \(e\). We have \(M_{v,e} = 1\) if \(v\) is an endpoint of \(e\) or \(M_{v,e} = 0\) otherwise. Then, we have the following result:

Theorem 2. The incidence matrix of a graph \(G\) is totally unimodular if and only if, \(G\) is bipartite.

This result can be used to derive the König-Egerváry theorem, stating that the maximum cardinality matching and the minimum vertex cover have the same value bipartite graphs.

The maximum cardinality can be modeled as integer linear programming:

\[\max \sum_{e \in E} y_e\] \[\begin{array}{llclr} & \sum_{e = (u, v)} y_e & \le & 1 & \forall v \in V\\ & y_e & \in & \{0, 1\} & \forall e \in E \end{array}\]

And its dual is the minimum vertex cover:

\[\min \sum_{v \in V} x_v\] \[\begin{array}{llclr} & x_u + x_v & \ge & 1 & \forall (u,v) \in E\\ & x_v & \le & \{0, 1\} & \forall v \in V \end{array}\]

It’s not hard to see that if \(M\) is the incidence matrix of the graph, then the problems can be stated as

(1) \(\max \{1y \mid My \le 1; y \mbox{ binary} \}\) and

(2) \(\min \{x1 \mid xM \ge 1; x \mbox{ binary} \}\)

If the graph is bipartite, we can use Theorem 2 and the strong duality for linear programs to conclude that (1) = (2).

2. Directed Graphs

Let \(D = (V, A)\) a directed graph, and \(M\) be the incidence matrix of \(D\). That is, a matrix where each line corresponds to a vertex and each column to an arc. For each arc \(e = (u, v)\), we have \(M_{u, e} = -1\) and \(M_{v, e} = 1\) and 0 otherwise. For directed graphs, we have a even stronger result:

Theorem 3. The incidence matrix of a directed graph \(D\) is totally modular.

Consider a network represented by \(D\) and with capacities represented by \(c : A \rightarrow \mathbb{R}_{+}\). For each directed edge \((ij) \in A\), let \(x_{ij}\) be the flow in this edge.

If \(M\) is the incidence matrix of \(D\), then \(Mx = 0\) corresponds to

\[\begin{array}{llclr} (3) & \sum_{(iv) \in A} x_{iv} & = & \sum_{(vi) \in A} x_{vi} & \forall v \in V\\ \end{array}\]

which are the flow conservation constraints. Since \(M\) is totally unimodular, then if \(c\) is integer, it’s possible to show that the polytope \(\{x \mid 0 \le x \le c; Mx = 0\}\) has integral vertices. This polytope also represents the constraints of the max circulation problem.

Now, we can use these observations to prove that the following LP formulation for the max-flow problem has an optimal integer solution:

\[\max \sum_{(si) \in A} x_{si}\]

Subject to:

\[\begin{array}{llclr} & \sum_{(iv) \in A} x_{iv} & = & \sum_{(vi) \in A} x_{vi} & \forall v \in V \setminus \{s, t\}\\ 0 \le & x_{ij} & \le & c_{ij} & \forall (ij) \in A\\ \end{array}\]

We can see that the constraints matrix of the above formulation is a submatrix of the max circulation problem and by Property 3, it’s also TU, which in turn means the corresponding polytope has integral vertices.


In this post, we introduced the concept of total unimodular matrices and presented two simple examples: the incidence matrix of a bipartite graph and the incidence matrix of a directed graph.

Here’s a cool chart of common polynomial time solvable problems organized by their generality [2].

In future posts, we’ll keep exploring this subject by studying other examples and properties of TU matrices.