3 papers
cs.AI2025
Mining Large Independent Sets on Massive Graphs
Yu Zhang, Witold Pedrycz, Chanjuan Liu +1
The Maximum Independent Set problem is fundamental for extracting conflict-free structure from large graphs, with applications in scheduling, recommendation, and network analysis.…
math.CO2025
The Total Coloring Conjecture holds for planar graphs without three special subgraphs
Rongjin Su, Gang Fang, Enqiang Zhu
The Total Coloring Conjecture (TCC) for planar graphs with a maximum degree of six remains open. Previous studies suggest that TCC is valid for such graphs if they do not contain a…
cs.LG2025
Boosting drug-disease association prediction for drug repositioning via dual-feature extraction and cross-dual-domain decoding
Enqiang Zhu, Xiang Li, Chanjuan Liu +1
The extraction of biomedical data has significant academic and practical value in contemporary biomedical sciences. In recent years, drug repositioning, a cost-effective strategy f…