Distortion Is Fixed Parameter Tractable
From MaRDI portal
Recommendations
- Distortion is fixed parameter tractable
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
- FPT algorithms for embedding into low complexity graphic metrics
- FPT Algorithms for Embedding into Low-Complexity Graphic Metrics
- Low-distortion embeddings of general metrics into the line
Cited in
(15)- Bandwidth and distortion revisited
- Pattern matching in doubling spaces
- On the minimum eccentricity shortest path problem
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- An exact algorithm for minimum distortion embedding
- What's next? Future directions in parameterized complexity
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
- Distortion is fixed parameter tractable
- An exact algorithm for minimum distortion embedding
- scientific article; zbMATH DE number 7758338 (Why is no real title available?)
- A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs
- On the minimum eccentricity shortest path problem
- scientific article; zbMATH DE number 7758347 (Why is no real title available?)
- FPT algorithms for embedding into low complexity graphic metrics
- Distortion in several variables
This page was built for publication: Distortion Is Fixed Parameter Tractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638056)