Lower Bounds for Fully Dynamic Connectivity Problems in Graphs

• 1 November 1998
• journal article
• research article
• Published by Springer Nature in Algorithmica
• Vol. 22  (3) , 351-362
• https://doi.org/10.1007/pl00009228

Abstract

Keywords

• KEY WORDS. DYNAMIC PLANARITY TESTING
• DYNAMIC CONNECTIVITY TESTING
• LOWER BOUNDS
• CELL PROBE MODEL.