Conte, A., Grossi, R., Kobayashi, Y., Kurita, K., Rucci, D., Uno, T., & Wasa, K. (2025). Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. Algorithmica, 87(9), 1247-1273. https://doi.org/10.1007/s00453-025-01312-0
Chicago-Zitierstil (17. Ausg.)Conte, Alessio, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, und Kunihiro Wasa. "Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size." Algorithmica 87, no. 9 (2025): 1247-1273. https://doi.org/10.1007/s00453-025-01312-0.
MLA-Zitierstil (9. Ausg.)Conte, Alessio, et al. "Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size." Algorithmica, vol. 87, no. 9, 2025, pp. 1247-1273, https://doi.org/10.1007/s00453-025-01312-0.