scientific article; zbMATH DE number 1003251

MaRDI QIDQ4335211zbMATH OpenFDO

Authors Johannes A. La Poutré, Jeffery R. Westbrook

Publication date 23 April 1997

zbMATH Keywords

data structuresdynamic graph problems

Mathematics Subject Classification ID

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

Recommendations

• Dynamic 2-Connectivity with Backtracking
• Dynamic 2- and 3-connectivity on planar graphs
• Fully Dynamic Algorithms for 2-Edge Connectivity
• Maintenance of 2- and 3-Edge-Connected Components of Graphs II

Cited in

(4)

• Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems
• Quasi-fully dynamic algorithms for two-connectivity and cycle equivalence
• scientific article; zbMATH DE number 1149402 (Why is no real title available?)
• Certificates and fast algorithms for biconnectivity in fully-dynamic graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4335211)