Pages that link to "Item:Q1199461"
From MaRDI portal
The following pages link to Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461):
Displayed 3 items.
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426) (← links)
- Minmax regret solutions for minimax optimization problems with uncertainty (Q1591541) (← links)
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem (Q1847357) (← links)