Showing cs.AIShow all
3 papers · 1 filter
cs.AI2025
Dynamic Location Search for Identifying Maximum Weighted Independent Sets in Complex Networks
Enqiang Zhu, Chenkai Hao, Chanjuan Liu +1
While Artificial intelligence (AI), including Generative AI, are effective at generating high-quality traffic data and optimization solutions in intelligent transportation systems…
cs.AI2025
GRALS: GCN-Guided Redundancy-Aware Local Search for Minimum Vertex Cover
Chanjuan Liu, Qiqi Bao, Yu Zhang +1
The minimum vertex cover (MVC) problem seeks to identify the smallest set of vertices that cover all edges in an undirected graph. As a fundamental NP-hard combinatorial optimizati…
cs.AI2022
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.…