Computer Science – Discrete Mathematics
Scientific paper
2010-04-26
Computer Science
Discrete Mathematics
20 pages
Scientific paper
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.
No associations
LandOfFree
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-32117