Now showing items 1-2 of 2

    • Improved Data Structures for Fully Dynamic Biconnectivity 

      Rauch, Monika H. (Cornell University, 1994-02)
      We present fully dynamic algorithms for maintaining the biconnected components in general and plane graphs. A fully dynamic algorithm maintains a graph during a sequence of insertions and and deletions of edges or isolated ...
    • Lower Bounds for Dynamic Connectivity Problems in Graphs 

      Fredman, Michael L.; Rauch, Monika H. (Cornell University, 1994-04)
      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 ...