Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k.

Autor:	Beideman, Calvin1 (AUTHOR), Chandrasekaran, Karthekeyan1 (AUTHOR) karthe@illinois.edu, Wang, Weihang1 (AUTHOR)
Zdroj:	Mathematical Programming. Sep2024, Vol. 207 Issue 1/2, p329-367. 39p.
Databáze:	Business Source Ultimate
Externí odkaz:	Zobrazit plný text záznamu Full text from SpringerLink