Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity
type: Item
instance of: scholarly article
title: Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity
zbMATH Open document ID: 1186.68141
author: Orestis A. Telelis
author: V. Zissimopoulos
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5694942
zbMATH Keywords: data structures
zbMATH Keywords: dynamic graph algorithms
zbMATH Keywords: graph connectivity
MaRDI profile type: Publication
full work available at URL: j.ipl.2007.11.020
OpenAlex ID: W2002946373
cites work: Q4398864
cites work: The Min-Max Spanning Tree Problem and some extensions
cites work: Introduction to algorithms
cites work: Maintaining the classes of 4-edge-connectivity in a graph on-line
cites work: Sparsification—a technique for speeding up dynamic graph algorithms
cites work: Algorithms for two bottleneck optimization problems
cites work: A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
cites work: A randomized linear-time algorithm to find minimum spanning trees
cites work: A linear time algorithm for the bottleneck biconnected spanning subgraph problem
cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
cites work: Maintenance of 2- and 3-Edge-Connected Components of Graphs II
cites work: Maintaining bridge-connected and biconnected components on-line
DOI: 10.1016/J.IPL.2007.11.020
description: scientific article; zbMATH DE number 5694942