Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time.

Andreas Björklund Petteri Kaski Lukasz Kowalik

Published in: ACM Trans. Algorithms (2017)

Keyphrases

data structure
data sets
data mining
neural network
website
clustering algorithm
pattern matching
application domains
graph mining
packing problem
memory efficient
connected subgraphs