Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size

Abstract

Graphlets of order $k$ in a graph $G$ are connected subgraphs induced by $k$ nodes (called $k$-graphlets) or by $k$ edges (called edge $k$-graphlets). They are among the interesting subgraphs in network analysis to get insights on both the local and global structure of a network. While several algorithms exist for discovering and enumerating graphlets, the cost per solution of such algorithms typically depends on the size of the graph $G$, or its maximum degree. In real networks, even the latter can be in the order of millions, whereas $k$ is typically required to be a small value. In this paper we provide the first algorithm to list all graphlets of order $k$ in a graph $G=(V,E)$ with an amortized cost per solution depending \emph{solely} on the order $k$, contrarily to previous approaches where the cost depends \emph{also} on the size of $G$ or its maximum degree. Specifically, we show that it is possible to list $k$-graphlets in $O(k^2)$ time per solution, and to list edge $k$-graphlets in $O(k)$ time per solution. Furthermore we show that, if the input graph has bounded degree, then the cost per solution for listing $k$-graphlets is reduced to $O(k)$. Whenever $k=O(1)$, as it is often the case in practical settings, these algorithms are the first to achieve constant time per solution.

This is the accepted version of the paper at Algorithmica (2025), after peer review

References in corpus (6)

• Community detection in graphs
• A Survey on Graph Kernels
• A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets
• Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four
• Efficient Enumeration of Bipartite Subgraphs in Graphs
• Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number