Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Ji, Mengtong"'
Autor:
Liu, Huaiyuan, Liu, Xianzhang, Yang, Donghua, Wang, Hongzhi, Long, Yingchi, Ji, Mengtong, Miao, Dongjing, Liang, Zhiyu
The Maximum Minimal Cut Problem (MMCP), a NP-hard combinatorial optimization (CO) problem, has not received much attention due to the demanding and challenging bi-connectivity constraint. Moreover, as a CO problem, it is also a daunting task for mach
Externí odkaz:
http://arxiv.org/abs/2408.08484
