1 citations · 1 across the 3 of their papers we have counts for
4 papers
A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
Yi Zhou, Chunyu Luo, Zhengren Wang +1
A graph with vertices is an -dense graph if it has at least edges, being a well-defined function. The notion -dense graph encompasses vari…
A Reduction-Driven Local Search for the Generalized Independent Set Problem
Yiping Liu, Yi Zhou, Zhenxiang Xu +2
The Generalized Independent Set (GIS) problem extends the classical maximum independent set problem by incorporating profits for vertices and penalties for edges. This generalized…
Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
Zhenxiang Xu, Yiping Liu, Yi Zhou +2
In a bipartite graph, a subgraph is an -biplex if each vertex of the subgraph is adjacent to all but at most vertices on the opposite set. The enumeration of -biplexes fr…
A Faster Branching Algorithm for the Maximum -Defective Clique Problem
Chunyu Luo, Yi Zhou, Zhengren Wang +1
A -defective clique of an undirected graph is a subset of its vertices that induces a nearly complete graph with a maximum of missing edges. The maximum -defective cl…