scientific article; zbMATH DE number 1263228

zbMath0978.68556MaRDI QIDQ4234100

Valerie King, Monika R. Henzinger

Publication date: 29 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)

Related Items (17)

Optimal on-line decremental connectivity in trees ⋮ Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm ⋮ Maintaining minimum spanning trees in dynamic graphs ⋮ A fast scaling algorithm for the weighted triangle-free 2-matching problem ⋮ Simple planar graph partition into three forests ⋮ Deterministic dynamic matching in worst-case update time ⋮ Certificates and fast algorithms for biconnectivity in fully-dynamic graphs ⋮ Fully Dynamic Transitive Closure in plane dags with one source and one sink ⋮ Trade-offs in dynamic coloring for bipartite and general graphs ⋮ Computing the map of geometric minimal cuts ⋮ Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time ⋮ Dynamic proximity calculations for situation awareness ⋮ Competitive graph searches ⋮ Theoretical underpinnings for maximal clique enumeration on perturbed graphs ⋮ Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs ⋮ Recognition of some perfectly orderable graph classes ⋮ Linking and cutting spanning trees

This page was built for publication: