Enumerating graphlets with amortized time complexity independent of graph size

DOI10.1007/S00453-025-01312-0MaRDI QIDQ6936585zbMATH OpenFDO

Authors Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Takeaki Uno, Kunihiro Wasa

Publication date 29 August 2025

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

enumerationgraph algorithmsgraphletssubgraphsamortization

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Enumeration in graph theory (05C30)

This page was built for publication: Enumerating graphlets with amortized time complexity independent of graph size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6936585)