Receipt: Refine coarse-grained independent tasks for parallel tip decomposition of bipartite graphs
Tip decomposition is a crucial kernel for mining dense subgraphs in bipartite networks, with
applications in spam detection, analysis of affiliation networks etc. It creates a hierarchy of …
applications in spam detection, analysis of affiliation networks etc. It creates a hierarchy of …
Truss community search in uncertain graphs
B Xing, Y Tan, J Zhou, M Du - Knowledge and Information Systems, 2024 - Springer
Given an uncertain graph, community search is used to return dense subgraphs that contain
the query vertex and satisfy the probability constraint. With the proliferation of uncertain …
the query vertex and satisfy the probability constraint. With the proliferation of uncertain …