Computing subgraph frequencies is a fundamental task that lies at the core of several
network analysis methodologies, such as network motifs and graphlet-based metrics, which …

When dealing with special graph classes and algorithmic problems on them, a main source
is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs [454]. The …

'Network'is a heavily overloaded term, so that 'network analysis' means different things to
different people. Specific forms of network analysis are used in the study of diverse …

We present an assortment of methods for finding and counting simple cycles of a given
length in directed and undirected graphs. Most of the bounds obtained depend solely on the …

From social science to biology, numerous applications often rely on graphlets for intuitive
and meaningful characterization of networks at both the global macro-level as well as the …

Motivation: Small-induced subgraphs called graphlets are emerging as a possible tool for
exploration of global and local structure of networks and for analysis of roles of individual …

In the past, the fundamental graph problem of triangle counting and listing has been studied
intensively from a theoretical point of view. Recently, triangle counting has also become a …

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 …

Complex networks are frequently employed to model physical or virtual complex systems.
When certain entities exist across multiple systems simultaneously, unveiling their …

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 …