Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract)

Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract) (0)

Cached

Download Links

[www.dis.uniroma1.it]

Other Repositories/Bibliography

DBLP

by Daniele Frigioni , Alberto Marchetti-spaccamela , Umberto Nanni

Venue:	In ACM-SIAM Symposium on Discrete Algorithms
Citations:	20 - 4 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract)	user correction - Legacy Corrections
AUTHOR NAME	Daniele Frigioni	SVM HeaderParse 0.1
AUTHOR AFFIL	yz	SVM HeaderParse 0.2
AUTHOR NAME	Alberto Marchetti-spaccamela	SVM HeaderParse 0.1
AUTHOR AFFIL	z	SVM HeaderParse 0.2
AUTHOR NAME	Umberto Nanni	SVM HeaderParse 0.1
AUTHOR AFFIL	z	SVM HeaderParse 0.2
AUTHOR ADDR	(Extended Abstract)	SVM HeaderParse 0.1
ABSTRACT	) Abstract We consider the problem of maintaining the distances and the shortest paths from a single source in either a directed or an undirected graph with positive real edge weights, handling insertions, deletions and cost updates of edges. We propose fully dynamic algorithms with optimal space requirements and query time. The cost of update operations depends on the class of the considered graph and on the number of vertices that, due to an edge modification, either change their distance from the source or change their parent in the shortest path tree. In the case of graphs with bounded genus (including planar graphs), bounded degree graphs, bounded treewidth graphs and fi-near-planar graphs with bounded fi, the update procedures require O(log n) amortized time per vertex update, while for general graphs with n vertices and m edges they require O( p m log n) amortized time per vertex update. The solution is based on a dynamization of Dijkstra's algorithm [6] and requires simple ...	user correction - Legacy Corrections
YEAR	0	user correction - Legacy Corrections
VENUE	In ACM-SIAM Symposium on Discrete Algorithms	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	212--221	INFERENCE
TECH	Technical Report	INFERENCE
CITATIONS	19 found	ParsCit 1.0