10 citations · 11 across the 5 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2024
Federated k-Core Decomposition: A Secure Distributed Approach
Bin Guo, Emil Sekerinski, Lingyang Chu
As one of the most well-studied cohesive subgraph models, the -core is widely used to find graph nodes that are ``central'' or ``important'' in many applications, such as biolog…
cs.DC2022★ 10 cited
Parallel Order-Based Core Maintenance in Dynamic Graphs
Bin Guo, Emil Sekerinski
The core numbers of vertices in a graph are one of the most well-studied cohesive subgraph models because of the linear running time. In practice, many data graphs are dynamic grap…
cs.DC2021
Efficient Parallel Graph Trimming by Arc-Consistency
Bin Guo, Emil Sekerinski
Given a large data graph, trimming techniques can reduce the search space by removing vertices without outgoing edges. One application is to speed up the parallel decomposition of…