Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:30, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs |
scientific article |
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