Viresh Patel
Published 2010-04-26Version 1
In this paper, we show that for an $n$-vertex graph $G$ of genus $g$, the edge expansion of $G$ can be determined in time $n^{O(g^2)}$. We show that the same is true for various other similar measures of edge connectivity.
Cover time of graphs with bounded genus
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Extension Complexity of the Correlation Polytope
![QR code for arXiv:1004.4484 [cs.DM]](http://oss.arxitics.com/images/favicon.svg)