Shortest Paths in Multiplex Networks
Sign Up to like & getrecommendations! Published in 2017 at "Scientific Reports"
DOI: 10.1038/s41598-017-01655-x
Abstract: The shortest path problem is one of the most fundamental networks optimization problems. Nowadays, individuals interact in extraordinarily numerous ways through their offline and online life (e.g., co-authorship, co-workership, or retweet relation in Twitter). These… read more here.
Keywords: shortest paths; paths multiplex; multiplex networks;