Oct 6, 2022 · In this paper we develop a data structure for (1-\epsilon)-approximate DSG that improves the one from [SW20] in two aspects.

Oct 6, 2022 · A data structure for $(1-\epsilon)-approximate DSG that improves the one from [SW20] in two aspects and extends in a natural fashion to ...

We believe that the space and update time improvements are valuable for current large scale graph data sets. The data structure extends in a natural fashion to ...

Oct 6, 2022 · Abstract. We consider the problem of maintaining a (1 − ǫ)-approximation to the densest subgraph. (DSG) in an undirected multigraph as it ...

Chandra Chekuri, Kent Quanrud: (1-ε)-approximate fully dynamic densest subgraph: linear space and faster update time. CoRR abs/2210.02611 (2022).

For dense graphs, a faster running time of. O(n. 1.495. ) has been shown by Sankowski [23], and to date this is the only known result that gives sublinear time ...

Then, there exists an algorithm to find a (1 −𝜖)-approximate densest subgraph in G in time eO(m𝜖. −2 · min(Δ,𝜖−1)). Here, eO hides polylogarithmic factors in n.

(1-ε)-approximate Fully Dynamic Densest Subgraph: Linear Space and Faster Update Time · C. ChekuriKent Quanrud. Computer Science, Mathematics. ArXiv. 2022. 3 ...

Jun 22, 2020 · We give the first fully dynamic algorithm which maintains a (1−є)-approximate densest subgraph in worst-case time poly(logn, є−1) per update ...

(1-ε)-approximate fully dynamic densest subgraph: linear space and faster update time. Manuscript, July 2022. with Chandra Chekuri · Convergence to ...