On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems
DOI10.1016/J.DAM.2024.04.014MaRDI QIDQ6559388
Author name not available (Why is that?), Ramin Javadi
Publication date: 21 June 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of finding uniform sparsest cuts in various graph classes
- On the complexity of isoperimetric problems on trees
- Clustering and outlier detection using isoperimetric number of trees
- Which problems have strongly exponential complexity?
- Bin packing with fixed number of bins revisited
- Tree-depth, subgraph coloring and homomorphism bounds
- Integer Programming with a Fixed Number of Variables
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication: On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559388)
