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 …

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 …

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 …

Densest subgraph detection has become an important primitive in graph mining tasks when
analyzing communities and detecting events in a wide range of application domains …

In this paper, we present a collection of novel and scalable algorithms designed to tackle the
challenges inherent in the $ k $-clique densest subgraph problem (\kcdsp) within network …

Graphs are a fundamental data structure used to represent relationships in domains as
diverse as the social sciences, bioinformatics, cybersecurity, the Internet, and more. One of …