Pages that link to "Item:Q631789"
From MaRDI portal
The following pages link to Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789):
Displaying 8 items.
- Permutation bigraphs and interval containments (Q401140) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
- On the minimum eccentricity shortest path problem (Q2404081) (← links)
- On the Minimum Eccentricity Shortest Path Problem (Q3449826) (← links)
- Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings (Q3604519) (← links)
- An Exact Algorithm for Minimum Distortion Embedding (Q5851098) (← links)