On Set Expansion Problems and the Small Set Expansion Conjecture
DOI10.1007/978-3-319-12340-0_16zbMATH Open1417.05164OpenAlexW154567010MaRDI QIDQ2945189FDOQ2945189
Publication date: 9 September 2015
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12340-0_16
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Approximation algorithms (68W25) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (3)
Recommendations
- On set expansion problems and the small set expansion conjecture π π
- The small set vertex expansion problem π π
- The Small Set Vertex expansion problem π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Some remarks on small sets π π
- Title not available (Why is that?) π π
- Counting sets with small sumset and applications π π
- On Sets with a Small Subset Sum π π
- On small sets of integers π π
This page was built for publication: On Set Expansion Problems and the Small Set Expansion Conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945189)