Pages that link to "Item:Q705742"
From MaRDI portal
The following pages link to Cuts, trees and \(\ell_1\)-embeddings of graphs (Q705742):
Displaying 43 items.
- Markov type and threshold embeddings (Q359547) (← links)
- Low-distortion embeddings of graphs with large girth (Q413201) (← links)
- A doubling subset of \(L_p\) for \(p>2\) that is inherently infinite dimensional (Q464256) (← links)
- Metric characterizations of superreflexivity in terms of word hyperbolic groups and finite graphs (Q483939) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees (Q634672) (← links)
- A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Coarse differentiation and multi-flows in planar graphs (Q848676) (← links)
- Randomly removing \(g\) handles at once (Q991176) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- An introduction to the Ribe program (Q1936714) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- Analysis on Laakso graphs with application to the structure of transportation cost spaces (Q2055392) (← links)
- Isometric structure of transportation cost spaces on finite metric spaces (Q2081200) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
- Isometric embedding of Busemann surfaces into \(L_1\) (Q2256580) (← links)
- Impossibility of dimension reduction in the nuclear norm (Q2291451) (← links)
- Nonexistence of embeddings with uniformly bounded distortions of Laakso graphs into diamond graphs (Q2374152) (← links)
- On the geometry of the countably branching diamond graphs (Q2402681) (← links)
- Pathwidth, trees, and random embeddings (Q2439830) (← links)
- Non-greedy online Steiner trees on outerplanar graphs (Q2659774) (← links)
- Metric embeddings of Laakso graphs into Banach spaces (Q2676705) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Non-greedy Online Steiner Trees on Outerplanar Graphs (Q2971163) (← links)
- DIAMOND GRAPHS AND SUPER-REFLEXIVITY (Q3398976) (← links)
- The cut cone,L1 embeddability, complexity, and multicommodity flows (Q3984283) (← links)
- A CODING OF BUNDLE GRAPHS AND THEIR EMBEDDINGS INTO BANACH SPACES (Q4555395) (← links)
- Distortion of embeddings of binary trees into diamond graphs (Q4595998) (← links)
- FPT algorithms for embedding into low complexity graphic metrics (Q5009595) (← links)
- Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
- Lipschitz-free Spaces on Finite Metric Spaces (Q5110164) (← links)
- Algorithms – ESA 2004 (Q5464574) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ (Q5499733) (← links)
- (Q5743377) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5918431) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5925650) (← links)
- Stochastic approximation of lamplighter metrics (Q6048880) (← links)
- 𝐿₁-distortion of Wasserstein metrics: A tale of two dimensions (Q6050836) (← links)
- (Q6087213) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time (Q6589758) (← links)
- Stochastic embeddings of graphs into trees (Q6613290) (← links)
