CentiServer
comprehensive centrality resource and server for centralities calculation version: 1.0.0

Login




The Centiserver on OMICTools

OMICtools



Dangalchev Closeness Centrality


Definition

The Dangalchev Closeness Centrality define as:
Dangalchev Closeness Centrality
where d(i, j) is the is the distance between vertices i and j.
The calculations of this variation of closeness will be easier and we can use this definition for not connected graphs too.

See Residual Closeness Centrality

Requirements

Calculable in connected and not connected network.

References


Comments

There are no comment yet.

Add your comment

Name:
Email:
Sum of    and  
persianstat(10215502, 0);