Skip to main content
Conference Proceedings

Determining edge expansion and other connectivity measures of graphs of bounded genus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6346 LNCS(PART 1) 561-572
DOI: 10.1007/978-3-642-15775-2_48
6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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

Cite

CITATION STYLE

APA

Patel, V. (2010). Determining edge expansion and other connectivity measures of graphs of bounded genus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6346 LNCS, pp. 561–572). https://doi.org/10.1007/978-3-642-15775-2_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free