有界亏格图的边扩张度及其它连通度的判定
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
摘要：
本文证明了对于亏格为$g$的$n$ -顶点图$G$，$G$的边扩张可以在时间$n^{O(g^2)}$上确定.我们表明，同样的情况也适用于其他各种类似的边缘连接的措施。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
