A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem

Thumbnail Image
Date
1996
Authors
Manku, Gurmeet Singh
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem is presented. This improves theb hitherto best-known solution, which has a running time of 0( m + n log n), where m and n are the number of edges and vertices of the graph.
Description
Keywords
Algorithms, Combinatorial problems, Biconnectivity
Citation
Collections