A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10159010" target="_blank" >RIV/00216208:11320/13:10159010 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-40104-6_27" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-40104-6_27</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-40104-6_27" target="_blank" >10.1007/978-3-642-40104-6_27</a>

Result language
angličtina
Original language name
A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs
Original language description
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 size as an induced subgraph of G. The queries are answered in constant time.When the data structure is used to represent graphs from a class with bounded expansion (which includes planar graphs and more generally all proper classes closed on topological minors, as well as many other natural classes of graphs with bounded average degree), the amortized time complexity of updates is polylogarithmic.
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
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)