Total unimodularity and combinatorial theorems

Alan J. Hoffman

doi:10.1016/0024-3795(76)90047-1

Linear Algebra and Its Applications

Paper

01 Jan 1976

Total unimodularity and combinatorial theorems

View publication

Abstract

It is shown how a wide variety of transversal theorems can be given a common proof. The proof depends on a certain matrix being totally unimodular, and it is shown that total unimodularity is needed for the theorem to hold. © 1976.

Paper

Classification with nonmetric distances: Image retrieval and class representation

David W. Jacobs, Daphna Weinshall, et al.

IEEE Transactions on Pattern Analysis and Machine Intelligence

Paper

On some properties of contracting matrices

Chai Wah Wu

Linear Algebra and Its Applications

Paper

A Formal Treatment of Non-repudiation Protocols

Satoshi Hada

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Paper

A generic grouping algorithm and its quantitative analysis

Arnon Amir, Michael Lindenbaum

IEEE Transactions on Pattern Analysis and Machine Intelligence

View all publications

Abstract

Related

Classification with nonmetric distances: Image retrieval and class representation

On some properties of contracting matrices

A Formal Treatment of Non-repudiation Protocols

A generic grouping algorithm and its quantitative analysis