Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms

Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms (1995)

by Shiva Chaudhuri , Christos D. Zaroliagis

Citations:

19 - 2 self

User correction supplied by mph

Datum	Value	Source
TITLE	Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms	user correction - Legacy Corrections
AUTHOR NAME	Shiva Chaudhuri	user correction
AUTHOR AFFIL	Max-Planck Institut für Informatik	user correction
AUTHOR ADDR	Im Stadtwald, D-66123 Saarbrücken, Germany	user correction
AUTHOR NAME	Christos D. Zaroliagis	user correction
AUTHOR AFFIL	Max-Planck Institut fur Informatik	user correction
AUTHOR ADDR	Im Stadtwald, D-66123 Saarbrucken, Germany	user correction
ABSTRACT	We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efficiently answered. We give algorithms that depend on the treewidth of the input graph. When the treewidth is a constant, our algorithms can answer distance queries in O(ff(n)) time after O(n) preprocessing. This improves upon previously known results for the same problem. We also give a dynamic algorithm which, after a change in an edge weight, updates the data structure in time O(n fi ), for any constant 0 ! fi ! 1. Furthermore, an algorithm of independent interest is given: computing a shortest path tree, or finding a negative cycle in linear time.	user correction
YEAR	1995	user correction
CITATIONS	21 found	ParsCit 1.0