1 citations · 1 across the 7 of their papers we have counts for
7 papers
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…
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…
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…
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…
A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem
Enqiang Zhu, Yu Zhang, Shengzhi Wang +2
Given a graph, the minimum dominating set (MinDS) problem is to identify a smallest set of vertices such that every vertex not in is adjacent to at least one vertex in .…
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.…
An Efficient System for Subgraph Discovery
Aparna Joshi, Yu Zhang, Petko Bogdanov +1
Subgraph discovery in a single data graph---finding subsets of vertices and edges satisfying a user-specified criteria---is an essential and general graph analytics operation with…