Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size

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 e...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 87; číslo 9; s. 1247 - 1273
Hlavní autoři: Conte, Alessio, Grossi, Roberto, Kobayashi, Yasuaki, Kurita, Kazuhiro, Rucci, Davide, Uno, Takeaki, Wasa, Kunihiro
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.09.2025
Springer Nature B.V
Témata:
Algorithm Analysis and Problem Complexity
Algorithms
Complexity
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Graph theory
Mathematics of Computing
Network analysis
Theory of Computation
Amortization
Enumeration
Graph algorithms
Subgraphs
Graphlets
ISSN:0178-4617, 1432-0541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 amortized time complexity 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 time complexity depending solely on the order k , contrarily to previous approaches where the cost depends 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 amortized time 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-025-01312-0