"Enumerating Graphlets with Amortized Time Complexity Independent of Graph ..."

Alessio Conte et al. (2025)

> Home

Details and statistics

DOI: 10.1007/S00453-025-01312-0

access: closed

type: Journal Article

metadata version: 2025-09-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ConteGKKRUW25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ConteGKKRUW25
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa:
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. Algorithmica 87(9): 1247-1273 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.