4 citations · 7 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013★ 4 cited
Dynamic Data Structure for Tree-Depth Decomposition
Zdenek Dvorak, Martin Kupec, Vojtech Tuma
We present a dynamic data structure for representing a graph with tree-depth at most . Tree-depth is an important graph parameter which arose in the study of sparse graph cl…
cs.DS2012
A dynamic data structure for counting subgraphs in sparse graphs
Zdenek Dvorak, Vojtech Tuma
We present a dynamic data structure representing a graph G, which allows addition and removal of edges from G and can determine the number of appearances of a graph of a bounded si…