We introduce graph motif parameters, a class of graph parameters that depend only on the
frequencies of constant-size induced subgraphs. Classical works by Lovász show that many …

For a pattern graph H on k nodes, we consider the problems of finding and counting the
number of (not necessarily induced) copies of H in a given large graph G on n nodes, as …

For a class C of graphs,# Sub (C) is the counting problem that, given a graph H from C and
an arbitrary graph G, asks for the number of subgraphs of G isomorphic to H. It is known that …

Detecting and counting the number of copies of certain subgraphs (also known as network
motifs or graphlets) is motivated by applications in a variety of areas ranging from biology to …

Triangle counting is a fundamental problem in the analysis of large graphs. There is a rich
body of work on this problem, in varying streaming and distributed models, yet all these …

We consider the problem of counting all $ k $-vertex subgraphs in an input graph, for any
constant $ k $. This problem (denoted sub-cnt $ _k $) has been studied extensively in both …

We consider the problem of counting the number of copies of a fixed graph H within an input
graph G. This is one of the most well-studied algorithmic graph problems, with many …

In the Subgraph Isomorphism problem we are given two graphs F and G on k and n vertices
respectively as an input, and the question is whether there exists a subgraph of G …

We present a general technique for detecting and counting small subgraphs. It consists of
forming special linear combinations of the numbers of occurrences of different induced …

We present an O∗(20.5 n) time and O∗(20.249999 n) space randomized algorithm for
solving worst-case Subset Sum instances with n integers. This is the first improvement over …