2000 character limit reached
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus (1004.4484v1)
Published 26 Apr 2010 in cs.DM and math.CO
Abstract: 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(g2)}$. We show that the same is true for various other similar measures of edge connectivity.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.