Publication:4230326
From MaRDI portal
zbMath0915.05082MaRDI QIDQ4230326
Publication date: 5 July 1999
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
Related Items
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, Data structures for two-edge connectivity in planar graphs, Decremental 2- and 3-connectivity on planar graphs