A Theorem on Flows in Networks 论文

2009Birkhäuser Boston eBooks引用 396
Computability, Logic, AI AlgorithmsOptimization and Search Problems

摘要

The theorem to be proved in this note is a generalization of a well-known combinatorial theorem of P. Hall, [4].