Skip to main content


eCommons@Cornell

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

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7180
Title: Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
Authors: Fredman, Michael
Henzinger, Monika
Keywords: computer science
technical report
Issue Date: Dec-1995
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1523
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, deletion, or 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 fully dynamic connectivity problems.
URI: http://hdl.handle.net/1813/7180
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
95-1523.pdf268.48 kBAdobe PDFView/Open
95-1523.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