The Max-Flow Min-Cut theorem for countable networks (Q618031): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.jctb.2010.08.002 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.JCTB.2010.08.002 / rank | |||
Normal rank |
Revision as of 05:06, 9 December 2024
scientific article
In more languages
ConfigureLanguage | Label | Description | Also known as |
---|---|---|---|
English | The Max-Flow Min-Cut theorem for countable networks |
scientific article |