A novel rough set-based approach for minimum vertex cover of hypergraphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Qian Zhou, Xiaojun Xie, Hua Dai 0003, Weizhi Meng. A novel rough set-based approach for minimum vertex cover of hypergraphs. Neural Computing and Applications, 34(24):21793-21808, 2022. [doi]

The following publications are possibly variants of this publication:

Test-cost-sensitive rough set based approach for minimum weight vertex cover problemXiaojun Xie, Xiaolin Qin, Chunqiang Yu, Xingye Xu. asc, 64:423-435, 2018. [doi]

Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough SetsQian Zhou, Xiaolin Qin, Xiaojun Xie. access, 6:50142-50153, 2018. [doi]

Dynamic Feature Selection Algorithm Based on Minimum Vertex Cover of HypergraphXiaojun Xie, Xiaolin Qin. pakdd 2018: 40-51 [doi]

runs on WebDSL