Cargando…
An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations
Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphl...
Autores principales: | Melckenbeeck, Ine, Audenaert, Pieter, Michoel, Tom, Colle, Didier, Pickavet, Mario |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4721873/ https://www.ncbi.nlm.nih.gov/pubmed/26797021 http://dx.doi.org/10.1371/journal.pone.0147078 |
Ejemplares similares
-
Optimising orbit counting of arbitrary order by equation selection
por: Melckenbeeck, Ine, et al.
Publicado: (2019) -
The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
por: Houbraken, Maarten, et al.
Publicado: (2014) -
The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees
por: Demeyer, Sofie, et al.
Publicado: (2013) -
A construction heuristic for the capacitated Steiner tree problem
por: Van den Eynde, Simon, et al.
Publicado: (2022) -
Combinatorial algorithm for counting small induced graphs and orbits
por: Hočevar, Tomaž, et al.
Publicado: (2017)