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

dynamic data structuresincremental algorithmsall pairs shortest paths problem

Mathematics Subject Classification ID

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

Cited in

(12)

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

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)