Cargando…
Algorithm for shortest path search in Geographic Information Systems by using reduced graphs
The use of Geographic Information Systems has increased considerably since the eighties and nineties. As one of their most demanding applications we can mention shortest paths search. Several studies about shortest path search show the feasibility of using graphs for this purpose. Dijkstra’s algorit...
Autores principales: | Rodríguez-Puente, Rafael, Lazo-Cortés, Manuel S |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3755817/ https://www.ncbi.nlm.nih.gov/pubmed/24010024 http://dx.doi.org/10.1186/2193-1801-2-291 |
Ejemplares similares
-
Euclidean shortest paths: exact or approximate algorithms
por: Li, Fajie, et al.
Publicado: (2014) -
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
por: Zhang, Xiaoge, et al.
Publicado: (2014) -
A shortest-path graph kernel for estimating gene product semantic similarity
por: Alvarez, Marco A, et al.
Publicado: (2011) -
Distributed algorithms from arboreal ants for the shortest path problem
por: Garg, Shivam, et al.
Publicado: (2023) -
Shortest Paths in Multiplex Networks
por: Ghariblou, Saeed, et al.
Publicado: (2017)