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…