Centrality defines how important a vertice in a graph. If one vertice shows frequently in shortest path among any other two vertices, it must have high centrality. The computation of centrality is useful in the area of social networks.
-
Notifications
You must be signed in to change notification settings - Fork 0
Parallel computation of centrality
License
drstarry/Parallel_BFS
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Parallel computation of centrality
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published