New algorithm speeds up computation of network centrality by 33x!
A new method has been developed to quickly calculate how central each node is in a changing network. This method is especially useful for networks with different types of connections and directions. By combining filtering techniques and smart updates, the method can calculate node centrality much faster than before. Testing on real-world data showed an average speed increase of 33 times. This method can also be split up and run on multiple computers at once.