97 citations · 167 across the 24 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DB2022
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…
cs.DS2022
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…
cs.LG2022
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…