23 citations · 26 across the 8 of their papers we have counts for
8 papers
Fast Maximum -Plex Algorithms Parameterized by Small Degeneracy Gaps
Zhengren Wang, Yi Zhou, Chunyu Luo +2
Given a graph, a -plex is a set of vertices in which each vertex is not adjacent to at most other vertices in the set. The maximum -plex problem, which asks for the lar…
Extracting Densest Sub-hypergraph with Convex Edge-weight Functions
Yi Zhou, Shan Hu, Zimo Sheng
The densest subgraph problem (DSG) aiming at finding an induced subgraph such that the average edge-weights of the subgraph is maximized, is a well-studied problem. However, when t…
Listing Maximal k-Plexes in Large Real-World Graphs
Zhengren Wang, Yi Zhou, Mingyu Xiao +1
Listing dense subgraphs in large graphs plays a key task in varieties of network analysis applications like community detection. Clique, as the densest model, has been widely inves…
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
Ming Sun, Xinyu Wu, Yi Zhou +2
The Steiner tree problem aims to determine a minimum edge-weighted tree that spans a given set of terminal vertices from a given graph. In the past decade, a considerable number of…
Enhancing Balanced Graph Edge Partition with Effective Local Search
Zhenyu Guo, Mingyu Xiao, Yi Zhou +2
Graph partition is a key component to achieve workload balance and reduce job completion time in parallel graph processing systems. Among the various partition strategies, edge par…
The Complexity of the Partition Coloring Problem
Zhenyu Guo, Mingyu Xiao, Yi Zhou
Given a simple undirected graph and a partition of the vertex set into parts, the \textsc{Partition Coloring Problem} asks if we can select one vertex from each p…
Combining tabu search and graph reduction to solve the maximum balanced biclique problem
Yi Zhou, Jin-Kao Hao
The Maximum Balanced Biclique Problem is a well-known graph model with relevant applications in diverse domains. This paper introduces a novel algorithm, which combines an effectiv…
Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem
Yi Zhou, André Rossi, Jin-Kao Hao
The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ide…