scientific article
From MaRDI portal
Publication:3138872
zbMath0800.68625MaRDI QIDQ3138872
Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Giorgio Ausiello, Umberto Nanni
Publication date: 2 January 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Data structures (68P05)
Related Items
Dynamic expression trees ⋮ All-pairs shortest paths and the essential subgraph ⋮ On the computational complexity of dynamic graph problems ⋮ A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs ⋮ Dynamic maintenance of directed hypergraphs ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ A special case the of dynamization problem for least cost paths ⋮ On-line computation of minimal and maximal length paths ⋮ Maintenance of triconnected components of graphs ⋮ Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Dynamically maintaining split graphs
