Cargando…

On the shortest path problem of uncertain random digraphs

In the field of graph theory, the shortest path problem is one of the most significant problems. However, since varieties of indeterminated factors appear in complex networks, determining of the shortest path from one vertex to another in complex networks may be a lot more complicated than the cases...

Descripción completa

Detalles Bibliográficos
Autores principales: Li, Hao, Zhang, Kun
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer Berlin Heidelberg 2022
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9308943/
https://www.ncbi.nlm.nih.gov/pubmed/35909949
http://dx.doi.org/10.1007/s00500-022-07305-3

Ejemplares similares