Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Lower Bounds for Dynamic Connectivity Problems in Graphs
Authors: Fredman, Michael L.
Rauch, Monika H.
Keywords: computer science
technical report
Issue Date: Apr-1994
Publisher: Cornell University
Abstract: We prove lower bounds on the complexity of maintaining fully dynamic $k$-edge or $k$-vertex connectivity in plane graphs and in $(k-1)$-vertex connected graphs. We show an amortized lower bound of $\Omega(\log n/k(\log\log n + \log b))$ per edge insertion or deletion or per query operation in the cell probe model, where $b$ is the word size of the machine and $n$ is the number of vertices in $G$. We also show an amortized lower bound of $\Omega(\log n/(\log\log n + \log b))$ per operation for fully dynamic planarity testing in embedded graphs. These are the first lower bounds for dynamic connectivity problems.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
94-1420.pdf962.37 kBAdobe PDFView/Open
94-1420.ps307.35 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us