Dynamic Data Structure for Tree-Depth Decomposition

  title={Dynamic Data Structure for Tree-Depth Decomposition},
  author={Zdenek Dvorak and Martin Kupec and Vojtech Tuma},
We present a dynamic data structure for representing a graph G with tree-depth at most D. Tree-depth is an important graph parameter which arose in the study of sparse graph classes. The structure allows addition and removal of edges and vertices such that the resulting graph still has tree-depth at most D, in time bounds depending only on D. A tree-depth decomposition of the graph is maintained explicitly. This makes the data structure useful for dynamization of static algorithms for graphs… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 10 references

Hlineny, Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences

P. J. Gajarsky
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS • 2012
View 4 Excerpts
Highly Influenced

Model Checking Lower Bounds for Simple Graphs

Logical Methods in Computer Science • 2013
View 1 Excerpt

Similar Papers

Loading similar papers…