Differential privacy from locally adjustable graph algorithms: k-core decomposition, low out-degree ordering, and densest subgraphs
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 …
privacy. Designing such algorithms for graph data is gaining importance with the growth of …
Fully dynamic maximal independent set with polylogarithmic update time
S Behnezhad, M Derakhshan… - 2019 IEEE 60th …, 2019 - ieeexplore.ieee.org
We present the first algorithm for maintaining a maximal independent set (MIS) of a fully
dynamic graph-which undergoes both edge insertions and deletions-in polylogarithmic time …
dynamic graph-which undergoes both edge insertions and deletions-in polylogarithmic time …
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries
In fully dynamic clustering problems, a clustering of a given data set in a metric space must
be maintained while it is modified through insertions and deletions of individual points. In …
be maintained while it is modified through insertions and deletions of individual points. In …
Fully dynamic maximal independent set with sublinear update time
A maximal independent set (MIS) can be maintained in an evolving m-edge graph by simply
recomputing it from scratch in O (m) time after each update. But can it be maintained in time …
recomputing it from scratch in O (m) time after each update. But can it be maintained in time …
Massively parallel computation of matching and MIS in sparse graphs
The Massively Parallel Computation (MPC) model serves as a common abstraction of many
modern large-scale parallel computation frameworks and has recently gained a lot of …
modern large-scale parallel computation frameworks and has recently gained a lot of …
Fully dynamic maximal independent set in expected poly-log update time
In the fully dynamic maximal independent set (MIS) problem our goal is to maintain an MIS
in a given graph G while edges are inserted and deleted from the graph. The first non-trivial …
in a given graph G while edges are inserted and deleted from the graph. The first non-trivial …
Improved dynamic graph coloring
This article studies the fundamental problem of graph coloring in fully dynamic graphs. Since
the problem of computing an optimal coloring, or even approximating it to within n1-ε for any …
the problem of computing an optimal coloring, or even approximating it to within n1-ε for any …
Dynamic set cover: improved algorithms and lower bounds
We give new upper and lower bounds for the dynamic set cover problem. First, we give a (1+
є) f-approximation for fully dynamic set cover in O (f 2log n/є5)(amortized) update time, for …
є) f-approximation for fully dynamic set cover in O (f 2log n/є5)(amortized) update time, for …
Adaptive Out-Orientations with Applications
We give improved algorithms for maintaining edge-orientations of a fully-dynamic graph,
such that the maximum out-degree is bounded. On one hand, we show how to orient the …
such that the maximum out-degree is bounded. On one hand, we show how to orient the …
Sparsity-parameterised dynamic edge colouring
ABJ Christiansen, E Rotenberg, J Vlieghe - arXiv preprint arXiv …, 2023 - arxiv.org
We study the edge-colouring problem, and give efficient algorithms where the number of
colours is parameterised by the graph's arboricity, $\alpha $. In a dynamic graph, subject to …
colours is parameterised by the graph's arboricity, $\alpha $. In a dynamic graph, subject to …