Dynamic 2-Connectivity with Backtracking

DOI10.1137/S0097539794272582MaRDI QIDQ4210133zbMATH OpenOpenAlexFDO

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

Publication date 21 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539794272582

zbMATH Keywords

backtrackingdynamic graph algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1003251
• Fully Dynamic Algorithms for 2-Edge Connectivity
• Dynamic 2- and 3-connectivity on planar graphs
• Maintenance of 2- and 3-Edge-Connected Components of Graphs II

Cited in

(1)

• Fully Dynamic Algorithms for 2-Edge Connectivity

This page was built for publication: Dynamic 2-Connectivity with Backtracking

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