I/O-optimal algorithms for planar graphs using separators
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An external memory data structure for shortest path queries
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Dynamic Algorithm for Maintaining Graph Partitions
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Partitioning Planar Graphs with Costs and Weights
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Graph Separator Algorithms: A Refined Analysis
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Graph separators: a parameterized view
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Three problems about simple polygons
Computational Geometry: Theory and Applications
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science
Partitioning planar graphs with costs and weights
Journal of Experimental Algorithmics (JEA)
Succinct geometric indexes supporting point location queries
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
Three problems about simple polygons
Computational Geometry: Theory and Applications
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximate shortest path queries on weighted polyhedral surfaces
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms (TALG)
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
| Hi-index | 0.00 |
This paper develops new techniques for constructing separators for graphs embedded on surfaces of bounded genus. For any arbitrarily small positive $\varepsilon$ we show that any $n$-vertex graph $G$ of genus $g$ can be divided in $O(n+g)$ time into components whose sizes do not exceed $\varepsilon n$ by removing a set $C$ of $O(\sqrt{(g+1/\varepsilon)n})$ vertices. Our result improves the best previous ones with respect to the size of $C$ and the time complexity of the algorithm. Moreover, we show that one can cut off from $G$ a piece of no more than $(1-\varepsilon)n$ vertices by removing a set of $O(\sqrt{n\varepsilon (g\varepsilon +1})$) vertices. Both results are optimal up to a constant factor.