scientific article; zbMATH DE number 432746

MaRDI QIDQ3138872zbMATH OpenFDO

Authors Giuseppe F. Italiano, Giorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni

Publication date 2 January 1994

zbMATH Keywords

all pairs shortest paths problemdynamic data structuresincremental algorithms

Mathematics Subject Classification ID

Paths and cycles (05C38) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(12)

• Dynamically maintaining split graphs
• A special case the of dynamization problem for least cost paths
• On-line computation of minimal and maximal length paths
• Dynamic expression trees
• On the computational complexity of dynamic graph problems
• All-pairs shortest paths and the essential subgraph
• Single-source shortest paths and strong connectivity in dynamic planar graphs
• A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
• Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
• Maintenance of triconnected components of graphs
• Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.
• Dynamic maintenance of directed hypergraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138872)