hal-00724768, version 1
Shortest paths and Eikonal equations on a graph
(23/03/2012)
Abstract: An important problem in graph theory is to detect the shortest paths connecting the vertices of a graph to a prescribed target vertex. Here we study a generalization of the previous problem: finding the shortest path connecting any point of a graph (and not only a vertex) to the target. Our approach is based on the study of Eikonal equations and the corresponding theory of viscosity solutions on topological graphs.
- 1:
- Universita di Roma "La Sapienza"
- Domain : Mathematics/Analysis of PDEs
Mathematics/Numerical Analysis
- hal-00724768, version 1
- http://hal.inria.fr/hal-00724768
- oai:hal.inria.fr:hal-00724768
- From:
- Submitted on: Wednesday, 22 August 2012 15:33:13
- Updated on: Wednesday, 22 August 2012 15:33:13
Associated documents
Export