A linear time algorithm for the bottleneck biconnected spanning subgraph problem

Authors:
Gurmeet Singh Manku
Affiliations:
-
Venue:
Information Processing Letters
Year:
1996

Citing 0
Cited 4

Dynamic bottleneck optimization for k-edge and 2-vertex connectivity

Information Processing Letters
The bottleneck 2-connected k-Steiner network problem for k≤2

Discrete Applied Mathematics
Experimental analysis of heuristics for the bottleneck traveling salesman problem

Journal of Heuristics
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis

Computers and Operations Research

Quantified Score

Hi-index	0.89

Visualization

Abstract