Decremental 2- and 3-connectivity on planar graphs
type: Item
instance of: scholarly article
title: Decremental 2- and 3-connectivity on planar graphs
zbMATH Open document ID: 0858.68064
DOI: 10.1007/BF01955676
author: Dora Giammarresi
author: Giuseppe F. Italiano
published in: Algorithmica
publication date: 1996-10-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 936186
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: dynamic data structures
zbMATH Keywords: edge connectivity
zbMATH Keywords: planar graphs
zbMATH Keywords: vertex connectivity
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q4038721
cites work: Q4230327
cites work: Maintenance of a minimum spanning forest in a dynamic plane graph
cites work: An On-Line Edge-Deletion Problem
cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
cites work: Q4036576
cites work: Fully Dynamic Algorithms for 2-Edge Connectivity
cites work: Maintaining the 3-Edge-Connected Components of a Graph On-Line
cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi
cites work: Maintenance of 2- and 3-edge-connected components of graphs. I
cites work: Q4230326
cites work: Improved data structures for fully dynamic biconnectivity
cites work: Maintaining bridge-connected and biconnected components on-line
full work available at URL: https://doi.org/10.1007/bf01955676
OpenAlex ID: W1991632262
description: scientific article; zbMATH DE number 936186