Algorithms for Finding Motifs in Large Labeled Networks

The goal of this chapter is to introduce the different kinds of subgraph analysis problems and discuss some of the important parallel algorithmic techniques that have been developed for them. This chapter focuses primarily on the problem of counting the number of occurrences of a given subgraph. We consider some special classes of subgraphs including trees, triangles and cliques.