Recommendations
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- Sparsest cuts and concurrent flows in product graphs.
- Sparsest-cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- The complexity status of problems related to sparsest cuts
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
Cites work
- scientific article; zbMATH DE number 3914356 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
- The maximum concurrent flow problem
Cited in
(32)- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time
- A mixed integer model for the sparsest cut problem
- Bounds on isoperimetric values of trees
- Linear time algorithms for finding sparsest cuts in various graph classes
- Bounds on maximum concurrent flow in random bipartite graphs
- The complexity status of problems related to sparsest cuts
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time
- Improved approximations for the minimum-cut ratio and the flux
- A structured family of clustering and tree construction methods
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- Sparsest-cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Rational solutions of the graphsack problem
- The complexity of finding uniform sparsest cuts in various graph classes
- Convex programming based spectral clustering
- A linear time algorithm for graph partition problems
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Column-generation based bounds for the homogeneous areas problem
- Employee workload balancing by graph partitioning
- On Canonical Concurrent Flows, Crossing Number and Graph Expansion
- Optimal sufficient requirements on the embedded Ising problem in polynomial time
- Convergence and synchronization in networks of piecewise-smooth systems via distributed discontinuous coupling
- Partitioning well-clustered graphs: spectral clustering works!
- Sparsest cuts and concurrent flows in product graphs.
- Integrality gaps for sparsest cut and minimum linear arrangement problems
- Mean isoperimetry with control on outliers: exact and approximation algorithms
- Isoperimetric inequalities in simplicial complexes
- Graph clustering
- Polynomiality of sparsest cuts with fixed number of sources
- Extremal cuts of sparse random graphs
- NP-hardness of Euclidean sum-of-squares clustering
- All-Pairs Min-Cut in Sparse Networks
This page was built for publication: Sparsest cuts and bottlenecks in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810053)
