Pages that link to "Item:Q991793"
From MaRDI portal
The following pages link to Hardness and approximation of minimum distortion embeddings (Q991793):
Displaying 4 items.
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- On the minimum eccentricity shortest path problem (Q2404081) (← links)
- On the Minimum Eccentricity Shortest Path Problem (Q3449826) (← links)