Graphlet correlation distance to compare small graphs.
Graph models are standard for representing mutual relationships between sets of entities. Often, graphs deal with a large number of entities with a small number of connections (e.g. social media relationships, infectious disease spread). The distances or similarities between such large graphs are kn...
Main Authors: | Jérôme Roux, Nicolas Bez, Paul Rochet, Rocío Joo, Stéphanie Mahévas |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2023-01-01
|
Series: | PLoS ONE |
Online Access: | https://doi.org/10.1371/journal.pone.0281646 |
Similar Items
-
Graphlet correlation distance to compare small graphs
by: Jérôme Roux, et al.
Published: (2023-01-01) -
Computation of Graphlet Orbits for Nodes and Edges in Sparse Graphs
by: Tomaž Hočevar, et al.
Published: (2016-07-01) -
IncGraph: Incremental graphlet counting for topology optimisation.
by: Robrecht Cannoodt, et al.
Published: (2018-01-01) -
Encoding edge type information in graphlets.
by: Mingshan Jia, et al.
Published: (2022-01-01) -
Graphettes: Constant-time determination of graphlet and orbit identity including (possibly disconnected) graphlets up to size 8.
by: Adib Hasan, et al.
Published: (2017-01-01)