Login / Signup
Faster algorithms for counting subgraphs in sparse graphs.
Marco Bressan
Published in:
Algorithmica (2021)
Keyphrases
</>
data structure
learning algorithm
worst case
computationally efficient
data mining
graph mining
graph properties
maximum clique
labeled graphs
memory efficient
graph theoretic
graph databases
graph theory
graph data
highly efficient
np complete
significant improvement
regularized regression