Given a user-specified minimum degree threshold γ γ, a γ γ-quasi-clique is a subgraph
where each vertex connects to at least γ γ fraction of the other vertices. Quasi-clique is a …

Big data have become an important asset due to its immense power hidden in analytics.
Every organization is inundated with colossal amount of data generated with high speed …

Finding from a big graph those subgraphs that satisfy certain conditions is useful in many
applications such as community detection and subgraph matching. These problems have a …

Multi-instance graph algorithms interleave the evaluation of multiple instances of the same
algorithm with different inputs over the same graph. They have been shown to be …

Many real-time OLAP systems have been proposed to query evolving data with sub-second
latency. Although this feature is highly attractive, it is very hard to be achieved on analytic …

We study distributed graph algorithms that adopt an iterative vertex-centric framework for
graph processing, popularized by the Google's Pregel system. Since then, there are several …

In this book chapter, we introduce a pipeline to mine significant biomedical entities (or
bioentities) in biological networks. Our focus is on prioritizing both bioentities themselves …

Quasi-cliques and k-plexes are dense structures with established significance in graph
mining, offering flexibility and resilience to data anomalies. However, mining these …