Shortest Paths in Multiplex Networks
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 interactions have two ke...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2017-05-01
|
| Series: | Scientific Reports |
| Online Access: | https://doi.org/10.1038/s41598-017-01655-x |