Shortest paths and Eikonal equations on a graph

Details Shortest paths and Eikonal equations on a graph Shortest paths and Eikonal equations on a graph

2011-05-28

arxiv.org/abs/1105.5725v2

Mathematics

Analysis of PDEs

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Shortest paths and Eikonal equations on a graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Shortest paths and Eikonal equations on a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Shortest paths and Eikonal equations on a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49897