scientific article; zbMATH DE number 7378705
From MaRDI portal
Publication:5009595
DOI10.4230/LIPIcs.ESA.2018.35zbMath1499.68291arXiv1801.03253MaRDI QIDQ5009595
Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1801.03253
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27) Metric embeddings as related to computational problems and algorithms (68R12)
Cites Work
- Unnamed Item
- Unnamed Item
- Cuts, trees and \(\ell_1\)-embeddings of graphs
- Connected tree-width
- The geometry of graphs and some of its algorithmic applications
- Distortion is Fixed Parameter Tractable
- Low-distortion embeddings of general metrics into the line
- Low Distortion Maps Between Point Sets
- A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs
- Parameterized Algorithms
- Advances in metric embedding theory
This page was built for publication:
