DeepAI
Log In Sign Up

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles

05/31/2020
by   Jiehua Chen, et al.
0

We present a data structure that in a dynamic graph of treedepth at most d, which is modified over time by edge insertions and deletions, maintains an optimum-height elimination forest. The data structure achieves worst-case update time 2^ O(d^2), which matches the best known parameter dependency in the running time of a static fpt algorithm for computing the treedepth of a graph. This improves a result of Dvořák et al. [ESA 2014], who for the same problem achieved update time f(d) for some non-elementary (i.e. tower-exponential) function f. As a by-product, we improve known upper bounds on the sizes of minimal obstructions for having treedepth d from doubly-exponential in d to d^ O(d). As applications, we design new fully dynamic parameterized data structures for detecting long paths and cycles in general graphs. More precisely, for a fixed parameter k and a dynamic graph G, modified over time by edge insertions and deletions, our data structures maintain answers to the following queries: - Does G contain a simple path on k vertices? - Does G contain a simple cycle on at least k vertices? In the first case, the data structure achieves amortized update time 2^ O(k^2). In the second case, the amortized update time is 2^ O(k^4) + O(k log n). In both cases we assume access to a dictionary on the edges of G.

READ FULL TEXT

page 7

page 8

page 11

page 20

page 23

page 25

page 26

page 31

01/29/2020

Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds

Given a directed weighted graph G=(V,E) undergoing vertex insertions and...
07/14/2022

Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs (Extended version)

Answering connectivity queries is fundamental to fully dynamic graphs wh...
07/13/2021

Maintaining 𝖢𝖬𝖲𝖮_2 properties on dynamic structures with bounded feedback vertex number

Let φ be a sentence of 𝖢𝖬𝖲𝖮_2 (monadic second-order logic with quantific...
01/29/2020

Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary

Given a dynamic digraph G = (V,E) undergoing edge deletions and given s∈...
05/01/2022

Dynamic data structures for parameterized string problems

We revisit classic string problems considered in the area of parameteriz...
03/31/2022

Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary

We study reachability and shortest paths problems in dynamic directed gr...
06/26/2019

A Stricter Heap Separating Points-To Logic

Dynamic memory issues are hard to locate and may cost much of a developm...