97 citations · 167 across the 24 of their papers we have counts for
14 papers · 1 filter
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs
You Peng, Xuemin Lin, Michael Yu +2
The Feedback vertex set with the minimum size is one of Karp's 21 NP-complete problems targeted at breaking all the cycles in a graph. This problem is applicable to a broad variety…
Higher-Order Neighborhood Truss Decomposition
Zi Chen, Long Yuan, Li Han +1
-truss model is a typical cohesive subgraph model and has been received considerable attention recently. However, the -truss model only considers the direct common neighbors…
FAST: FPGA-based Subgraph Matching on Massive Graphs
Xin Jin, Zhengyi Yang, Xuemin Lin +3
Subgraph matching is a basic operation widely used in many applications. However, due to its NP-hardness and the explosive growth of graph data, it is challenging to compute subgra…
Efficient and Effective Community Search on Large-scale Bipartite Graphs
Kai Wang, Wenjie Zhang, Xuemin Lin +3
Bipartite graphs are widely used to model relationships between two types of entities. Community search retrieves densely connected subgraphs containing a query vertex, which has b…
AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing
Michael Yu, Lu Qin, Ying Zhang +2
Triangle listing is an important topic significant in many practical applications. Efficient algorithms exist for the task of triangle listing. Recent algorithms leverage an orient…
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
Kai Wang, Xuemin Lin, Lu Qin +2
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 contain…