Faster algorithms for counting subgraphs in sparse graphs
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-021-00811-0
Abstract: 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:… read more here.
Keywords: graphs; degeneracy; usepackage; faster algorithms ... See more keywords