A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10312998" target="_blank" >RIV/00216208:11320/14:10312998 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-662-44777-2_28" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-662-44777-2_28</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-662-44777-2_28" target="_blank" >10.1007/978-3-662-44777-2_28</a>

Result language
angličtina
Original language name
A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth
Original language description
Tree-depth is an important graph parameter which arose in the study of sparse graph classes. We present a dynamic data structure for representing a graph G with tree-depth at most D. The structure allows addition and removal of edges and vertices under assumption 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 graphswith bounded tree-depth. As an example application, we give a dynamic data structure for MSO property testing.
Czech name
—
Czech description
—

Project
<a href="/en/project/LH12095" target="_blank" >LH12095: New combinatorial algorithms - decompositions, parameterization, efficient solutions</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)