Abstract
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. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Dvořák, Z., & Tůma, V. (2013). A dynamic data structure for counting subgraphs in sparse graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8037 LNCS, pp. 304–315). https://doi.org/10.1007/978-3-642-40104-6_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
