1 citations · 1 across the 2 of their papers we have counts for
2 papers
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.DB2020★ 1 cited
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…