97 citations · 167 across the 24 of their papers we have counts for
25 papers
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…
Balanced Clique Computation in Signed Networks: Concepts and Algorithms
Zi Chen, Long Yuan, Xuemin Lin +2
Clique is one of the most fundamental models for cohesive subgraph mining in network analysis. Existing clique model mainly focuses on unsigned networks. However, in real world, ma…
Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching
Hanchen Wang, Ying Zhang, Lu Qin +3
Subgraph matching is a fundamental problem in various fields that use graph structured data. Subgraph matching algorithms enumerate all isomorphic embeddings of a query graph q in…
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…