The Small Set Vertex expansion problem

DOI10.1016/j.tcs.2021.07.017OpenAlexW4205165053MaRDI QIDQ2232595

Soumen Maity, Garima Agrawal

Publication date: 6 October 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.07.017

zbMATH Keywords

treewidthparameterized complexityFPTclique widthneighbourhood diversityW[1-hard]

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. III. Planar tree-width
• Recent developments on graphs of bounded clique-width
• Treewidth. Computations and approximations
• Algorithmic meta-theorems for restrictions of treewidth
• Graph expansion and the unique games conjecture
• Integer Programming with a Fixed Number of Variables
• New Tools for Graph Coloring
• A threshold of ln n for approximating set cover
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• The Densest $k$-Subhypergraph Problem
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Graph Layout Problems Parameterized by Vertex Cover
• Minkowski's Convex Body Theorem and Integer Programming
• Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
• Parameterized Algorithms
• Expander flows, geometric embeddings and graph partitioning

This page was built for publication: The Small Set Vertex expansion problem