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

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 87; no. 9; pp. 1247 - 1273
Main Authors:	Conte, Alessio, Grossi, Roberto, Kobayashi, Yasuaki, Kurita, Kazuhiro, Rucci, Davide, Uno, Takeaki, Wasa, Kunihiro
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2025 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!