Combinatorial theorems about embedding trees on the real line
From MaRDI portal
Publication:3005116
DOI10.1002/jgt.20608zbMath1217.05058MaRDI QIDQ3005116
Amit Chakrabarti, Subhash A. Khot
Publication date: 7 June 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20608
05C05: Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Embeddings of binary trees in lines
- The metrical interpretation of superreflexivity in Banach spaces
- On Lipschitz embedding of finite metric spaces in Hilbert space
- Optimal embedding of complete binary trees into lines and grids
- Fast geometric approximation techniques and geometric embedding problems
- Approximating the bandwidth via volume respecting embeddings
- Embedding tree metrics into low-dimensional Euclidean spaces
- The geometry of graphs and some of its algorithmic applications
- Measured descent: A new embedding method for finite metrics
- Improved Bandwidth Approximation for Trees and Chordal Graphs
- Low-distortion embeddings of general metrics into the line
- Expander flows, geometric embeddings and graph partitioning
- Trees and Markov convexity