Zobrazeno 1 - 10
of 281
pro vyhledávání: '"Jin, Mingming"'
An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
The Maximum s-Bundle Problem (MBP) addresses the task of identifying a maximum s-bundle in a given graph. A graph G=(V, E) is called an s-bundle if its vertex connectivity is at least |V|-s, where the vertex connectivity equals the minimum number of
Externí odkaz:
http://arxiv.org/abs/2402.03736
The Maximum k-Defective Clique Problem (MDCP) aims to find a maximum k-defective clique in a given graph, where a k-defective clique is a relaxation clique missing at most k edges. MDCP is NP-hard and finds many real-world applications in analyzing d
Externí odkaz:
http://arxiv.org/abs/2308.07235
A k-plex in a graph is a vertex set where each vertex is non-adjacent to at most k vertices (including itself) in this set, and the Maximum k-plex Problem (MKP) is to find the largest k-plex in the graph. As a practical NP-hard problem, MKP has many
Externí odkaz:
http://arxiv.org/abs/2301.07300
Autor:
Dong, Xian, Liu, Xiyu, Lin, Dan, Zhang, Lian, Wu, Yue, Chang, Yuzhen, Jin, Mingming, Huang, Gang
Publikováno v:
In Phytomedicine October 2024 133
Publikováno v:
In Biomedical Signal Processing and Control September 2024 95 Part A
Publikováno v:
In Science of the Total Environment 20 August 2024 939
Autor:
Jin, Mingming1 (AUTHOR) jmm_bjfu@163.com, Wang, Shuokai1 (AUTHOR) wangshuokai@bjfu.edu.cn, Chen, Ni2,3 (AUTHOR) 5652@henu.edu.cn, Feng, Yong1 (AUTHOR) f15690845893@163.com, Cao, Fangping1 (AUTHOR) cfp_888@bjfu.edu.cn
Publikováno v:
Agronomy. Jul2024, Vol. 14 Issue 7, p1460. 22p.
Publikováno v:
In International Immunopharmacology 10 May 2024 132
Autor:
Jia, Wentao, Liang, Shufang, Jin, Mingming, Li, Shu, Yuan, Jiaying, Zhang, Jinbo, Lin, Wanfu, Wang, Yuqian, Nie, Shuchang, Ling, Changquan, Cheng, Binbin
Publikováno v:
In Phytomedicine April 2024 126
Publikováno v:
In International Immunopharmacology 30 March 2024 130