With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …

Simple graph algorithms such as PageRank have been the target of numerous hardware
accelerators. Yet, there also exist much more complex graph mining algorithms for problems …

We consider the community search problem defined upon a large graph G: given a query
vertex q in G, to find as output all the densely connected subgraphs of G, each of which …

The core decomposition of networks has attracted significant attention due to its numerous
applications in real-life problems. Simply stated, the core decomposition of a network …

Highlights•Network approaches can be used to investigate synteny between many
species.•We present a generalized approach for elucidating plant phylogenomic …

The problem of computing (α, β)-core in a bipartite graph for given α and β is a fundamental
problem in bipartite graph analysis and can be used in many applications such as online …

Bipartite graphs are widely used to model relation-ships between two types of entities.
Community search retrieves densely connected subgraphs containing a query vertex, which …

Existing graph-processing frameworks let users develop efficient implementations for many
graph problems, but none of them support efficiently bucketing vertices, which is needed for …

Cohesive subgraph mining in bipartite graphs becomes a popular research topic recently.
An important structure k-bitruss is the maximal cohesive subgraph where each edge is …

Bipartite networks are of great importance in many realworld applications. In bipartite
networks, butterfly (ie, a complete 2× 2 biclique) is the smallest non-trivial cohesive structure …