.png){kind=icon}
.png){kind=icon}
Return
Computing shortest cycles using universal covering space
.png){kind=icon}
PRE
AI
DOI：10.1007/s00371-007-0169-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we generalize the shortest path algorithm to the shortest cycles in each homotopy class on a surface with arbitrary topology, utilizing the universal covering space (UCS) in algebraic topology. In order to store and handle the UCS, we propose a two-level data structure which is efficient for storage and easy to process. We also pointed several practical applications for our shortest cycle algorithms and the UCS data structure.
Keywords:
shortest cycles
universal covering
homotopy
Journal
IF:
2.9
Papers:
4.6K
Citations:
6.5K
Organization
No organization information available