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

Andreas Björklund, Petteri Kaski, Lukasz Kowalik. Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. ACM Transactions on Algorithms, 13(4), 2017. [doi]

Abstract

Abstract is missing.