3 papers
cs.DC2025
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.DS2024
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…
cs.DC2024
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…