Chunyu Luo

collaborators

2 papers

cs.DS2025

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems

Yi Zhou, Chunyu Luo, Zhengren Wang +1

A graph with $n$ vertices is an $f (\cdot)$ -dense graph if it has at least $f (n)$ edges, $f (\cdot)$ being a well-defined function. The notion $f (\cdot)$ -dense graph encompasses vari…

cs.DS2024

A Faster Branching Algorithm for the Maximum $k$ -Defective Clique Problem

Chunyu Luo, Yi Zhou, Zhengren Wang +1

A $k$ -defective clique of an undirected graph $G$ is a subset of its vertices that induces a nearly complete graph with a maximum of $k$ missing edges. The maximum $k$ -defective cl…

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems

A Faster Branching Algorithm for the Maximum k-Defective Clique Problem

A Faster Branching Algorithm for the Maximum $k$ -Defective Clique Problem