a novel algorithm for the fast detection of hubs in chemical networks is presented. thealgorithm identifies a set of nodes in the network as most significant, aimed to be the mosteffective points of distribution for fast, widespread coverage throughout the system. we showthat our hubs have in general greater closeness centrality and betweenness centrality thanvertices with maximal degree, while...
