de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44874

Kutz,  Martin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Kutz, M. (2006). Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time. In Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06 (pp. 430-437). New York, USA: ACM.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-2261-F
Zusammenfassung
We present an algorithm that computes a shortest non-contractible and a shortest non-separating cycle on an orientable combinatorial surface of bounded genus in $O(n log n)$ time, where $n$ denotes the complexity of the surface. This solves a central open problem in computational topology, improving upon the current-best $O(n \frac{3}{2})$-time algorithm by Cabello and Mohar (ESA 2005). Our algorithm is based on universal-cover constructions to find short cycles and makes extensive use of existing tools from the field.