Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 94336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs |
scientific article; zbMATH DE number 94336 |
Statements
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (English)
0 references
16 January 1993
0 references
Euclidean bottleneck biconnected edge subgraph problem
0 references
relative neighborhood graph
0 references
algorithm
0 references
binary search technique
0 references
biconnectivity
0 references
time complexity
0 references
0.8167130947113037
0 references
0.8136351108551025
0 references
0.8041644096374512
0 references
0.7829465866088867
0 references
0.7681332230567932
0 references
