35 citations · 79 across the 15 of their papers we have counts for
4 papers · 1 filter
Temporal -Core Query, Revisited
Yinyu Liu, Kaiqiang Yu, Shengxin Liu +2
Querying cohesive subgraphs in temporal graphs is essential for understanding the dynamic structure of real-world networks, such as evolving communities in social platforms, shifti…
Maximal Clique Enumeration with Hybrid Branching and Early Termination
Kaixin Wang, Kaiqiang Yu, Cheng Long
Maximal clique enumeration (MCE) is crucial for tasks like community detection and biological network analysis. Existing algorithms typically adopt the branch-and-bound framework w…
Maximum -Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach
Kaiqiang Yu, Cheng Long
Enumerating maximal -biplexes (MBPs) of a bipartite graph has been used for applications such as fraud detection. Nevertheless, there usually exists an exponential number of MBP…
Efficient Algorithms for Maximal k-Biplex Enumeration
Kaiqiang Yu, Cheng Long, Shengxin Liu +1
Mining maximal subgraphs with cohesive structures from a bipartite graph has been widely studied. One important cohesive structure on bipartite graphs is k-biplex, where each verte…