On a class of totally unimodular matrices

  • Authors:

  • Mihalis Yannakakis

  • Affiliations:

  • -

  • Venue:
  • SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
  • Year:
  • 1980

  • The checkpoint problem

    APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

  • The checkpoint problem

    Theoretical Computer Science

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.