Computing the stretch of an embedded graph

Investor logo

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

CABELLO Sergio CHIMANI Markus HLINĚNÝ Petr

Year of publication 2014
Type Article in Periodical
Magazine / Source SIAM Journal on Discrete Mathematics
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1137/130945636
Field General mathematics
Keywords topological graph theory; embedded graph; crossings; nonseparating cycle; homology basis
Description Let G be a graph embedded in an orientable surface Sigma, possibly with edge weights, and denote by len(gamma) the length (the number of edges or the sum of the edge weights) of a cycle. in G. The stretch of a graph embedded on a surface is the minimum of len(alpha) . len(beta) over all pairs of cycles alpha and beta that cross exactly once. We provide two algorithms to compute the stretch of an embedded graph, each based on a different principle. The first algorithm is based on surgery and computes the stretch in time O(g(4)n log n) with high probability, or in time O(g(4)n log(2) n) in the worst case, where g is the genus of the surface S and n is the number of vertices in G. The second algorithm is based on using a short homology basis and computes the stretch in time O(n(2) log n + n(2)g + ng(3)).
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.