Pages that link to "Item:Q5248539"
From MaRDI portal
The following pages link to Excluded minors, network decomposition, and multicommodity flow (Q5248539):
Displaying 32 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)
- Separators in region intersection graphs (Q4638049) (← links)
- Graph Clustering using Effective Resistance (Q4993308) (← links)
- Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- (Q5009588) (← links)
- Asymptotic dimension of planes and planar graphs (Q5047910) (← links)
- (Q5088977) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- Comparison of Metric Spectral Gaps (Q5402099) (← links)
- Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow (Q5874526) (← links)
- (Q5875457) (← links)
- Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)
