A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem

Abstract

We study the problem of identifying an optimal biconnected spanning subgraph of an undirected graph with respect to a bottleneck objective function. In a graph with m edges and n nodes, our logarithm has a worst-case complexity of O( m + n log n). This improves the best available O( m log n) bound for the problem. The min-sum version of this problems is known to be NP-hard.