O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Partitioning graphs into balanced components
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
| Hi-index | 0.00 |
The average degree of a subgraph $H$ of the $r$-dimensional hypercube $Q_r$ equals at most the maximum Hamming distance of any two nodes in $H$. A corollary is that the minimum number of edges to delete from $Q_r$ such that any two nodes at Hamming distance $\ell$ are separated is $(r+1-\ell) 2^{r-1}$. This corollary has applications to multicommodity flows.