"Faster Subgraph Counting in Sparse Graphs."

Marco Bressan (2019)
a service of Schloss Dagstuhl - Leibniz Center for Informatics