scientific article; zbMATH DE number 1256641

zbMath0977.68560MaRDI QIDQ4230327

David Eppstein, A. Nissenzweig, Giuseppe F. Italiano, Zvi Galil

Publication date: 17 January 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items

Data structures for two-edge connectivity in planar graphs ⋮ Maintaining spanning trees of small diameter ⋮ Dynamic Euclidean minimum spanning trees and extrema of binary functions ⋮ Using sparsification for parametric minimum spanning tree problems ⋮ Fully dynamic biconnectivity in graphs ⋮ Dynamic 2- and 3-connectivity on planar graphs ⋮ Average case analysis of dynamic geometric optimization ⋮ Dyn-FO: A parallel, dynamic complexity class ⋮ Maintaining minimum spanning trees in dynamic graphs ⋮ Decremental 2- and 3-connectivity on planar graphs ⋮ Certificates and fast algorithms for biconnectivity in fully-dynamic graphs ⋮ Fully Dynamic Transitive Closure in plane dags with one source and one sink ⋮ Output-sensitive reporting of disjoint paths (extended abstract) ⋮ Average case analysis of fully dynamic connectivity for directed graphs ⋮ Fully dynamic maintenance of vertex cover ⋮ Dynamic and static algorithms for optimal placement of resources in a tree ⋮ Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time ⋮ Approximating minimum cuts under insertions ⋮ On mixed connectivity certificates ⋮ Dynamic proximity calculations for situation awareness ⋮ A uniform approach to semi-dynamic problems on digraphs ⋮ On mixed connectivity certificates ⋮ Finding the k Shortest Paths ⋮ Average case analysis of fully dynamic reachability for directed graphs