scientific article; zbMATH DE number 1256640
From MaRDI portal
zbMath0915.05082MaRDI QIDQ4230326
Publication date: 5 July 1999
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) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items
Data structures for two-edge connectivity in planar graphs, Decremental 2- and 3-connectivity on planar graphs, Certificates and fast algorithms for biconnectivity in fully-dynamic graphs, Theoretical underpinnings for maximal clique enumeration on perturbed graphs, A uniform approach to semi-dynamic problems on digraphs