7 papers
Cohesive Group Discovery in Interaction Graphs under Explicit Density Constraints
Yu Zhang, Yilong Luo, Mingyuan Ma +4
Discovering cohesive groups is a fundamental primitive in graph-based recommender systems, underpinning tasks such as social recommendation, bundle discovery, and community-aware m…
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.…
Exact Optimization for Minimum Dominating Sets
Enqiang Zhu, Qiqi Bao, Yu Zhang +2
The Minimum Dominating Set (MDS) problem is a well-established combinatorial optimization problem with numerous real-world applications. Its NP-hard nature makes it increasingly di…
HyColor: An Efficient Heuristic Algorithm for Graph Coloring
Enqiang Zhu, Yu Zhang, Haopeng Sun +4
The graph coloring problem (GCP) is a classic combinatorial optimization problem that aims to find the minimum number of colors assigned to vertices of a graph such that no two adj…
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…
GRALS: GCN-Guided Redundancy-Aware Local Search for Minimum Vertex Cover
Enqiang Zhu, 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…