Cargando…
A centrality measure for cycles and subgraphs II
In a recent work we introduced a measure of importance for groups of vertices in a complex network. This centrality for groups is always between 0 and 1 and induces the eigenvector centrality over vertices. Furthermore, its value over any group is the fraction of all network flows intercepted by thi...
Autores principales: | Giscard, Pierre-Louis, Wilson, Richard C. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6214294/ https://www.ncbi.nlm.nih.gov/pubmed/30839787 http://dx.doi.org/10.1007/s41109-018-0064-5 |
Ejemplares similares
-
SubRank: Subgraph Embeddings via a Subgraph Proximity Measure
por: Balalau, Oana, et al.
Publicado: (2020) -
The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
por: Houbraken, Maarten, et al.
Publicado: (2014) -
Pathway discovery in metabolic networks by subgraph extraction
por: Faust, Karoline, et al.
Publicado: (2010) -
The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
por: McCreesh, Ciaran, et al.
Publicado: (2020) -
The frequent complete subgraphs in the human connectome
por: Fellner, Máté, et al.
Publicado: (2020)