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...
Enregistré dans:
Auteurs principaux: | Saeed Ghariblou, Mostafa Salehi, Matteo Magnani, Mahdi Jalili |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Nature Portfolio
2017
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/de36e3bfc2314b6585af54655cffc61c |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
Identification of colorectal cancer related genes with mRMR and shortest path in protein-protein interaction network.
par: Bi-Qing Li, et autres
Publié: (2012) -
Problems on Shortest k-Node Cycles and Paths
par: Petro Stetsyuk, et autres
Publié: (2021) -
PRYNT: a tool for prioritization of disease candidates from proteomics data using a combination of shortest-path and random walk algorithms
par: Franck Boizard, et autres
Publié: (2021) -
Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
Publié: (2020) -
EEG-based functional brain networks: does the network size matter?
par: Amir Joudaki, et autres
Publié: (2012)