Crossref
Quantifying randomness in complex graph sets using pairwise graph distances
Computing · 2026-08 · 108 (8)
DOI: 10.1007/s00607-026-01717-x ↗Kurz gefasst
Fachartikel in der Zeitschrift Computing, online erschienen am 20.07.2026. Verfasst von Bram Mornie und 3 weiteren Autor:innen. Die Arbeit nennt 55 Literaturangaben. Gefördert von: Universiteit Gent.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Universiteit Gent
Zitieren
APA
Mornie, B., Colle, D., Audenaert, P., & Pickavet, M. (2026). Quantifying randomness in complex graph sets using pairwise graph distances. Computing, 108(8). https://doi.org/10.1007/s00607-026-01717-x
Vancouver
Mornie B, Colle D, Audenaert P, Pickavet M. Quantifying randomness in complex graph sets using pairwise graph distances. Computing. 2026;108(8). doi:10.1007/s00607-026-01717-x
BibTeX
@article{Mornie2026,
author = {Mornie, Bram and Colle, Didier and Audenaert, Pieter and Pickavet, Mario},
title = {Quantifying randomness in complex graph sets using pairwise graph distances},
journal = {Computing},
year = {2026},
volume = {108},
number = {8},
doi = {10.1007/s00607-026-01717-x}
}
EUVIMED