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

Authors:
Viresh Patel
Affiliations:
School of Engineering and Computing Sciences, Durham University, Science Laboratories, Durham, UK
Venue:
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Year:
2010

Citing 12
Cited 2

Topological graph theory

Topological graph theory
Isoperimetric numbers of graphs

Journal of Combinatorial Theory Series B
Sparsest cuts and bottlenecks in graphs

Discrete Applied Mathematics - Computational combinatiorics
Faster algorithms for finding small edge cuts in planar graphs

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Finding minimum-quotient cuts in planar graphs

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface

SIAM Journal on Discrete Mathematics
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Greedy optimal homotopy and homology generators

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Expander flows, geometric embeddings and graph partitioning

Journal of the ACM (JACM)
Minimum cuts and shortest homologous cycles

Proceedings of the twenty-fifth annual symposium on Computational geometry

The complexity of finding uniform sparsest cuts in various graph classes

Journal of Discrete Algorithms
Counting and sampling minimum cuts in genus g graphs

Proceedings of the twenty-ninth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

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.