An exact and fast algorithm for computing top-k closeness centrality, tested on the IMDb databse
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
Luca Lombardo f914400fcf Clossness centrality attempt 1: 2.6 years to run 3 years ago
.gitignore Incomplete filter, to do 3 years ago
README.md Initial commit 3 years ago
filtro.py Incomplete filter, to do 3 years ago
kenobi.cpp Clossness centrality attempt 1: 2.6 years to run 3 years ago

README.md

imdb-graph