Jun 4, 2019 · Our new algorithm, Motivo, is able to scale well to larger graphs while at the same time provide more accurate graphlet counts than ever before.
In this paper we develop novel tools for the "motif counting via color coding" framework. As a result, our new algorithm, MOTIYO, scales to much larger graphs ...
Sep 4, 2020 · The current state-of-the-art algorithms estimate the motif counts via uniform sampling, by leveraging the color coding technique by Alon, Yuster and Zwick.
Missing: Motivo: | Show results with:Motivo:
May 19, 2021 · We address the problem of computing the distribution of induced connected subgraphs, aka graphlets or motifs, in large graphs.
The novel tools for the "motif counting via color coding" framework, MOTIYO, are developed, showing how color coding can bring motif mining to the realm of ...
This work introduces a novel adaptive sampling scheme that breaks the “additive error barrier” of uniform sampling, guaranteeing multiplicative ...
Oct 22, 2024 · On the accuracy side, in one hour MOTIVO produces accurate counts of ≈ 10.000 distinct 8-node motifs on graphs where state-of-the-art algorithms ...
Sep 4, 2020 · This algorithm, named. CC by the authors (after color coding), can reliably and accurately count motifs on k > 5 nodes on medium-large graphs ...
Motivo: fast motif counting via succinct color coding and adaptive sampling ... To give an idea of the improvements, in 40 minutes Motivo counts 7 -nodes motifs ...
Co-authors ; Motivo: fast motif counting via succinct color coding and adaptive sampling. M Bressan, S Leucci, A Panconesi. arXiv preprint arXiv:1906.01599, 2019.