5 papers
WCCS: Efficient Wedge Conductance Community Search over Large Temporal Bipartite Graphs (Full Paper)
Longlong Lin, Wei Chen, Pingpeng Yuan +3
Bipartite graphs are ubiquitous for modeling complex interactions between two distinct entity types across numerous practical applications such as e-commerce, academic networks, an…
Scalable Similarity Search over Large Attributed Bipartite Graphs
Xi Ou, Longlong Lin, Zeli Wang +2
Bipartite graphs are widely used to model relationships between entities of different types, where nodes are divided into two disjoint sets. Similarity search, a fundamental operat…
Effective and Efficient Conductance-based Community Search at Billion Scale
Longlong Lin, Yue He, Wei Chen +3
Community search is a widely studied semi-supervised graph clustering problem, retrieving a high-quality connected subgraph containing the user-specified query vertex. However, exi…
Towards Truss-Based Temporal Community Search
Huihui Yang, Chunxue Zhu, Longlong Lin +1
Identifying communities from temporal networks facilitates the understanding of potential dynamic relationships among entities, which has already received extensive applications. H…
XMiner: Efficient Directed Subgraph Matching with Pattern Reduction
Pingpeng Yuan, Yujiang Wang, Tianyu Ma +2
Graph pattern matching, one of the fundamental graph mining problems, aims to extract structural patterns of interest from an input graph. The state-of-the-art graph matching algor…