Lazy Shortest Path Computation In Dynamic Graphs

Lazy Shortest Path Computation In Dynamic Graphs

We address the problem of single-source shortest path computation in digraphs with non-negative edge weights subjected to frequent edge weight decreases such that only some shortest paths are requested in-between updates. We optimise a recent semidynamic algorithm for weight decreases previously...

Full description

Bibliographic Details
Main Author: Daniel Aioanei
Format: Article
Language:English
Published: AGH University of Science and Technology Press 2012-01-01
Series:Computer Science
Subjects:
single-source shortest path
dynamic graph
livewire
active snake
interactive image segmentationTheoretical aspects of computer science
Online Access:http://journals.agh.edu.pl/csci/article/download/4/1

Internet

http://journals.agh.edu.pl/csci/article/download/4/1

Similar Items