Journal article
Feasible Combinatorial Matrix Theory
Abstract
We give the first, as far as we know, feasible proof of König’s Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, and we show the equivalence of KMM to various Min-Max principles, with proofs of low complexity.
Authors
Fernández AG; Soltys M
Journal
Lecture Notes in Computer Science, Vol. 8087, , pp. 777–788
Publisher
Springer Nature
Publication Date
2013
DOI
10.1007/978-3-642-40313-2_68
ISSN
0302-9743