English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms

Chaudhuri, S., & Zaroliagis, C. (2000). Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms. Algorithmica, 27(3/4), 212-226.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Chaudhuri, Shiva1, Author           
Zaroliagis, Christos1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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(α(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β) , for any constant 0 < β < 1 . Furthermore, an algorithm of independent interest is given: computing a shortest path tree, or finding a negative cycle in linear time.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-022000
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 518152
Other: Local-ID: C1256428004B93B8-08065B16CD009B6AC1256A0F004E2366-ChaudhuriZaroliagis2000
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithmica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 27 (3/4) Sequence Number: - Start / End Page: 212 - 226 Identifier: ISSN: 0178-4617