A linear time algorithm for the bottleneck biconnected spanning subgraph problem (Q1847357): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(96)00088-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2102942840
@@ Property / OpenAlex ID: W2102942840 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+The Min-Max Spanning Tree Problem and some extensions
+Normal rank
@@ Property / cites work @@
+Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
+Normal rank
@@ Property / cites work @@
+The Bottleneck Traveling Salesman Problem
@@ Property / cites work: The Bottleneck Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On k-Nearest Neighbor Voronoi Diagrams in the Plane
+Normal rank
@@ Property / cites work @@
+Guaranteed performance heuristics for the bottleneck traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Traveling salesman problem under categorization
@@ Property / cites work: Traveling salesman problem under categorization / rank @@
+Normal rank
@@ Property / cites work @@
+A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1847357