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

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!