A survey on the densest subgraph problem and its variants

T Lanciano, A Miyauchi, A Fazzone, F Bonchi - ACM Computing Surveys, 2024 - dl.acm.org
The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …

Extreme Point Pursuit--Part I: A Framework for Constant Modulus Optimization

J Liu, Y Liu, WK Ma, M Shao, AMC So - arXiv preprint arXiv:2403.06506, 2024 - arxiv.org
This study develops a framework for a class of constant modulus (CM) optimization
problems, which covers binary constraints, discrete phase constraints, semi-orthogonal …

Cardinality-Constrained Binary Quadratic Optimization via Extreme Point Pursuit, with Application to the Densest K-Subgraph Problem

Y Liu, J Liu, WK Ma - ICASSP 2024-2024 IEEE International …, 2024 - ieeexplore.ieee.org
Cardinality-constrained binary quadratic optimization appears in various applications such
as finding a densest size-constrained subgraph from a graph. It is a challenging …

The triangle-densest-k-subgraph problem: Hardness, Lovász extension, and application to document summarization

A Konar, ND Sidiropoulos - Proceedings of the AAAI Conference on …, 2022 - ojs.aaai.org
We introduce the triangle-densest-K-subgraph problem (TDKS) for undirected graphs: given
a size parameter K, compute a subset of K vertices that maximizes the number of induced …

Mining Triangle-Dense Subgraphs of a Fixed Size: Hardness, Lovasz extension and´ Applications

A Konar, ND Sidiropoulos - IEEE Transactions on Knowledge …, 2024 - ieeexplore.ieee.org
We introduce the triangle-densest-k-subgraph problem (TDkS) for undirected graphs: given
a size parameter k, compute a subset of k vertices that maximizes the number of induced …

Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining

A Konar, ND Sidiropoulos - Proceedings of the AAAI Conference on …, 2024 - ojs.aaai.org
Dense subgraph discovery (DSD) is a key primitive in graph mining that typically deals with
extracting cliques and near-cliques. In this paper, we revisit the optimal quasi-clique (OQC) …

Local Centrality Minimization with Quality Guarantees

A Miyauchi, L Severini, F Bonchi - Proceedings of the ACM on Web …, 2024 - dl.acm.org
Centrality measures, quantifying the importance of vertices or edges, play a fundamental
role in network analysis. To date, triggered by some positive approximability results, a large …

Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs

O Balalau, F Bonchi, THH Chan, F Gullo… - ACM Transactions on …, 2024 - dl.acm.org
Finding dense subgraphs in large (hyper) graphs is a key primitive in a variety of real-world
application domains, encompassing social network analytics, event detection, biology, and …

Fairness-Regulated Dense Subgraph Discovery

E Kariotakis, N Sidiropoulos, A Konar - arXiv preprint arXiv:2412.02604, 2024 - arxiv.org
Dense subgraph discovery (DSD) is a key graph mining primitive with myriad applications
including finding densely connected communities which are diverse in their vertex …

Extreme Point Pursuit--Part II: Further Error Bound Analysis and Applications

J Liu, Y Liu, WK Ma, M Shao, AMC So - arXiv preprint arXiv:2403.06513, 2024 - arxiv.org
In the first part of this study, a convex-constrained penalized formulation was studied for a
class of constant modulus (CM) problems. In particular, the error bound techniques were …