10 citations · 11 across the 5 of their papers we have counts for
5 papers
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…
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…
New Concurrent Order Maintenance Data Structure
Bin Guo, Emil Sekerinski
The \emph{Order-Maintenance} (OM) data structure maintains a total order list of items for insertions, deletions, and comparisons. As a basic data structure, OM has many applicatio…
Simplified Algorithms for Order-Based Core Maintenance
Bin Guo, Emil Sekerinski
Graph analytics attract much attention from both research and industry communities. Due to the linear time complexity, the -core decomposition is widely used in many real-world…
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…