Finding EPS-graphs
From MaRDI portal
Cited in
(5)- Computing roots of graphs is hard
- Performance guarantees for the TSP with a parameterized triangle inequality
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
- Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem
This page was built for publication: Finding EPS-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1150378)