Skip to Main content Skip to Navigation
Journal articles

An approximation scheme for a Hamilton-Jacobi equation defined on a network

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.
Complete list of metadata

https://hal.inria.fr/hal-00724768
Contributor : Estelle Bouzat <>
Submitted on : Wednesday, August 22, 2012 - 3:33:13 PM
Last modification on : Wednesday, July 27, 2016 - 2:48:48 PM

Links full text

Identifiers

Citation

Fabio Camilli, Adriano Festa, Dirk Schieborn. An approximation scheme for a Hamilton-Jacobi equation defined on a network. Applied Numerical Mathematics, Elsevier, 2013, 73, pp.33-47. ⟨10.1016/j.apnum.2013.05.003⟩. ⟨hal-00724768⟩

Share

Metrics

Record views

695