论文信息 - On a class of totally unimodular matrices

On a class of totally unimodular matrices

We examine the class of matrices that satisfy Commoner's sufficient condition for total unimodularity [C], which we call restricted totally unimodular (RTUM). We show that a matrix is RTUM if and only if it can be decomposed in a very simple way into the incidence matrices (or their transposes) of bipartite graphs or directed graphs, and give a linear time algorithm to perform this task. Based on this decomposition, we show that the 0,1 Integer Programming Problem with an RTUM matrix of constraints has the same time complexity as the b-matching and the max flow problems.

Mihalis Yannakakis | M. Yannakakis

[1] F. G. Commoner,et al. A sufficient condition for a matrix to be totally unimodular , 1973, Networks.

[2] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[3] J. Hopcroft,et al. Efficient algorithms for graph manipulation , 1971 .

[4] J. Hopcroft,et al. Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[5] Amnon Naamad,et al. Network flow and generalized path compression , 1979, STOC.

[6] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .

[7] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.

[8] Klaus Truemper,et al. Polynomial algorithms for a class of linear programs , 1981, Math. Program..

[9] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[10] A. Tamir,et al. On totally unimodular matrices , 1976, Networks.

[11] Robert E. Tarjan,et al. Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..