23 citations · 24 across the 5 of their papers we have counts for
5 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…
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…
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…
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…