Shortest paths and Eikonal equations on a graph
Shortest paths from arbitrary points of a graph to a target node — an approach via eikonal equations and viscosity solutions on topological graphs. With Fabio Camilli and Adriano Festa, 2012.
Authors: Fabio Camilli, Adriano Festa, Dirk Schieborn
Reference: arXiv:1105.5725v2 · Article on ResearchGate
Year of publication: 2012
Abstract
A central problem in graph theory is the determination of shortest paths from the nodes of a graph to a given target node. We study a generalization: the search for the shortest path from an arbitrary point of a graph (not just a node) to the target. Our approach is based on the study of eikonal equations and the associated theory of viscosity solutions on topological graphs.