Cargando…
Faster algorithms for counting subgraphs in sparse graphs
Given a k-node pattern graph H and an n-node host graph G, the subgraph counting problem asks to compute the number of copies of H in G. In this work we address the following question: can we count the copies of H faster if G is sparse? We answer in the affirmative by introducing a novel tree-like d...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8550495/ https://www.ncbi.nlm.nih.gov/pubmed/34720296 http://dx.doi.org/10.1007/s00453-021-00811-0 |