Efficient Index for Temporal Core Queries over Bipartite Graphs

A Tian, A Zhou, Y Wang, X Jian, L Chen - Proceedings of the VLDB …, 2024 - dl.acm.org
Many real-world binary relations can be modelled as bipartite graphs, which can be
inherently temporal and each edge is associated with a timestamp. The (α, β)-core, a …

Efficient Parallel D-core Decomposition at Scale

W Luo, Y Fang, C Lin, Y Zhou - Proceedings of the VLDB Endowment, 2024 - dl.acm.org
Directed graphs are prevalent in social networks, web networks, and communication
networks. A well-known concept of the directed graph is the D-core, or (k, l)-core, which is …

Efficient counting of balanced (2, k)-bicliques in Signed Bipartite Graphs

M Kiran, A Das, S Banerjee - 2024 IEEE International …, 2024 - ieeexplore.ieee.org
Analysis of large-scale networks for different structural patterns (also called motifs) remains
an active area of research in the domain of graph data management and mining. In the past …

[PDF][PDF] Cohesive Subgraph Computation over Large-Scale Directed Graphs

X LIAO - 2024 - scholars.hkbu.edu.hk
Directed graphs are widely used data structures for representing large-scale entities and the
relationships among them in real-world applications, including online social networks …

Designing and Finding Beneficial Community Structures on Social Networks and Beyond

AT Zhou - 2024 - search.proquest.com
Ongraphs, the problem of community search is the task of identifying closely connected
entities which could be considered as part of a larger collective. However, in the real world …