Presentation
Computing the stretch of an embedded graph
Author/s | Cabello Justo, Sergio
Chimani, Markus Hliněný, Petr |
Editor | Díaz Báñez, José Miguel
Garijo Royo, Delia Márquez Pérez, Alberto Urrutia Galicia, Jorge |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada II |
Publication Date | 2013 |
Deposit Date | 2017-05-18 |
Published in |
|
Abstract | Let G be a graph embedded in an orientable surface Σ, possibly with edge weights, and denote by len(γ) 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 ... Let G be a graph embedded in an orientable surface Σ, possibly with edge weights, and denote by len(γ) 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(α)· len(β) over all pairs of cycles α and β that cross exactly once. We provide an algorithm to compute the stretch of an embedded graph in time O(g4n log n) with high probability, or in time O(g4n log2 n) in the worst case, where g is the genus of the surface Σ and n is the number of vertices in G. |
Project ID. | J1-4106
GReGAS GIG/11/E023 |
Citation | Cabello Justo, S., Chimani, M. y Hliněný, P. (2013). Computing the stretch of an embedded graph. En XV Spanish Meeting on Computational Geometry, Sevilla. |
Files | Size | Format | View | Description |
---|---|---|---|---|
Computing the stretch of an ... | 866.2Kb | [PDF] | View/ | |