Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Planar graphs; geometric and topological aspects of graph theory (05C10)
Recommendations
Cites work
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- A lower bound on the distortion of embedding planar metrics into Euclidean space
- An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
- Bilipschitz embeddings of metric spaces into space forms
- Embedding the diamond graph in L_p and dimension reduction in L₁
- Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
- Euclidean distortion and the sparsest cut
- Expander graphs and their applications
- Measured descent: A new embedding method for finite metrics
- On distance scales, embeddings, and efficient relaxations of the cut cone
- On embedding expanders into \(\ell_p\) spaces
- PLANE WITH $A_{\infty}$ -WEIGHTED METRIC NOT BILIPSCHITZ EMBEDDABLE TO ${\bb R}^n$
- Sharp uniform convexity and smoothness inequalities for trace norms
- The geometry of graphs and some of its algorithmic applications
- Volume distortion for subsets of Euclidean spaces
Cited in
(5)
This page was built for publication: On the optimality of gluing over scales
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635762)