A linear time algorithm for the bottleneck biconnected spanning subgraph problem

DOI10.1016/0020-0190(96)00088-9zbMath1052.68643OpenAlexW2102942840MaRDI QIDQ1847357

Gurmeet Singh Manku

Publication date: 24 June 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00088-9

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ Fixed parameter tractability of a biconnected bottleneck Steiner network problem ⋮ The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) ⋮ Experimental analysis of heuristics for the bottleneck traveling salesman problem ⋮ Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity

Cites Work

• Unnamed Item
• Guaranteed performance heuristics for the bottleneck traveling salesman problem
• Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
• Traveling salesman problem under categorization
• The Min-Max Spanning Tree Problem and some extensions
• A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• The Bottleneck Traveling Salesman Problem
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A linear time algorithm for the bottleneck biconnected spanning subgraph problem