Social network based applications have experienced exponential growth in recent years.
One of the reasons for this rise is that this application domain offers a particularly fertile …

The maximum clique problem (MCP) is to determine in a graph a clique (ie, a complete
subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other …

The growth of social media over the last decade has revolutionized the way individuals
interact and industries conduct business. Individuals produce data at an unprecedented rate …

The k-truss is a type of cohesive subgraphs proposed recently for the study of networks.
While the problem of computing most cohesive subgraphs is NP-hard, there exists a …

Balanced graph partitioning in the streaming setting is a key problem to enable scalable and
efficient computations on massive graph data such as web graphs, knowledge graphs, and …

GRASP is a multi-start metaheuristic for combinatorial optimization problems, in which each
iteration consists basically of two phases: construction and local search. The construction …

The past decade has witnessed the emergence of participatory Web and social media,
bringing people together in many creative ways. Millions of users are playing, tagging …

Graph mining is an important research area within the domain of data mining. The field of
study concentrates on the identification of frequent subgraphs within graph data sets. The …

Finding dense subgraphs is an important graph-mining task with many applications. Given
that the direct optimization of edge density is not meaningful, as even a single edge …

We present a new algorithm for finding large, dense subgraphs in massive graphs. Our
algorithm is based on a recursive application of fingerprinting via shingles, and is extremely …