Differentially private algorithms allow large-scale data analytics while preserving user
privacy. Designing such algorithms for graph data is gaining importance with the growth of …

The problem of finding dense components of a graph is a major primitive in graph mining
and data analysis. The densest subgraph problem (DSP) that asks to find a subgraph with …

Recent Advances in Multi-Pass Graph Streaming Lower Bounds Page 1 Recent Advances in
Multi-Pass Graph Streaming Lower Bounds Sepehr Assadi Cheriton School of Computer …

The algorithms community has been modeling the underlying key features and constraints of
massively parallel frameworks and using these models to discover new algorithmic …

Maintaining a k-core decomposition quickly in a dynamic graph has important applications
in network analysis. The main challenge for designing efficient exact algorithms is that a …

Graphs that are used to model real-world entities with vertices and relationships among
entities with edges, have proven to be a powerful tool for describing real-world problems in …

Given a directed graph $ G $ and integers $ k $ and $ l $, a D-core is the maximal subgraph
$ H\subseteq G $ such that for every vertex of $ H $, its in-degree and out-degree are no …

Directed graphs are prevalent in social networks, web networks, and communication
networks. A well-known concept of the directed graph is the D-core, or (k, l)-core, which is …

The distance-generalized core, also called (k, h)-core, is defined as the maximal subgraph
in which every vertex has at least k vertices at distance no longer than h. Compared with k …

We study the problem of coloring a given graph using a small number of colors in several
well-established models of computation for big data. These include the data streaming …