A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs
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.
Keywordssparse graphs subgraphs data structure
Unable to display preview. Download preview PDF.
- 5.Dvořák, Z., Král’, D., Thomas, R.: Deciding first-order properties for sparse graphs. In: FOCS, pp. 133–142. IEEE Computer Society (2010)Google Scholar
- 6.Dvořák, Z., Král’, D., Thomas, R.: Testing first-order properties for subclasses of sparse graphs. ArXiv e-prints, 1109.5036 (January 2013)Google Scholar
- 13.Milenkoviæ, T., Pržulj, N.: Uncovering biological network function via graphlet degree signatures. Cancer Informatics 6, 257 (2008)Google Scholar
- 14.Nešetřil, J., Ossona de Mendez, P.: Linear time low tree-width partitions and algorithmic consequences. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 391–400. ACM (2006)Google Scholar