Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus

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 nO(g2 ) . We show that the same is true for various other similar measures of edge connectivity.

• Type: Conference
• Year: 2010
• Where: ESA
• Authors: Viresh Patel
• Keywords: Algorithms, Edge Expansion, ESA 2010, Genus G, N-vertex Graph