scientific article; zbMATH DE number 1775391

zbMath1028.68221MaRDI QIDQ4542523

Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

Publication date: 1998

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

zbMATH Keywords

deterministic fully dynamic graph algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

Minimal fill in O(\(n^{2.69}\)) time ⋮ The dynamic complexity of transitive closure is in DynTC\(^{0}\). ⋮ GoSCAN: decentralized scalable data clustering ⋮ Computing Large Planar Regions in Terrains ⋮ Competitive graph searches ⋮ Fast reoptimization for the minimum spanning tree problem ⋮ A fully dynamic algorithm for maintaining the transitive closure ⋮ Optimal Algorithms for Detecting Network Stability ⋮ Recognition of some perfectly orderable graph classes ⋮ Computing large planar regions in terrains, with an application to fracture surfaces

This page was built for publication: