Pages that link to "Item:Q5248539"
From MaRDI portal
The following pages link to Excluded minors, network decomposition, and multicommodity flow (Q5248539):
Displayed 41 items.
- Markov type and threshold embeddings (Q359547) (← links)
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- Strong-diameter decompositions of minor free graphs (Q613118) (← links)
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees (Q634672) (← links)
- Metric uniformization and spectral bounds for graphs (Q659931) (← links)
- New graph decompositions with applications to emulations (Q675853) (← links)
- A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- An improved approximation ratio for the minimum linear arrangement problem (Q845884) (← links)
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- On average distortion of embedding metrics into the line (Q938313) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Randomly removing \(g\) handles at once (Q991176) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- Metric decompositions of path-separable graphs (Q1679219) (← links)
- Extending Lipschitz functions via random metric partitions (Q1770278) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Absolute Lipschitz extendability (Q1876864) (← links)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189) (← links)
- Sparse covers for planar graphs and graphs that exclude a fixed minor (Q2249746) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
- Correlation clustering in general weighted graphs (Q2503347) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- Separators in region intersection graphs (Q4638049) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- Comparison of Metric Spectral Gaps (Q5402099) (← links)
- Multi-way spectral partitioning and higher-order cheeger inequalities (Q5415539) (← links)
- Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
- The intrinsic dimensionality of graphs (Q5900392) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- Local embeddings of metric spaces (Q5919791) (← links)