The Feedback vertex set with the minimum size is one of Karp's 21 NP-com...
Clique is one of the most fundamental models for cohesive subgraph minin...
Subgraph matching is a fundamental problem in various fields that use gr...
k-truss model is a typical cohesive subgraph model and has been received...
Bipartite graphs are widely used to model relationships between two type...
Simulation and its variants (e.g., bisimulation and degree-preserving
si...
Triangle listing is an important topic significant in many practical
app...
Entity interaction prediction is essential in many important application...
Graph database has enjoyed a boom in the last decade, and graph queries
...
Recently, there have been some breakthroughs in graph analysis by applyi...
Graph is a ubiquitous structure in many domains. The rapidly increasing ...
Cohesive subgraph mining in bipartite graphs becomes a popular research ...
Temporal graphs are ubiquitous. Mining communities that are bursting in ...
Recently there emerge many distributed algorithms that aim at solving
su...
With the rapid development of information technologies, various big grap...
Graph edit distance (GED) is an important similarity measure adopted in ...