Finding one tight cycle
ACM Transactions on Algorithms(2010)
摘要
A cycle on a combinatorial surface is tight if it as short as possible in its (free) homotopy class. We describe an algorithm to compute a single tight, noncontractible, essentially simple cycle on a given orientable combinatorial surface in O(n log n) time. The only method previously known for this problem was to compute the globally shortest noncontractible or nonseparating cycle in O(min{g3,n}, n log n) time, where g is the genus of the surface. As a consequence, we can compute the shortest cycle freely homotopic to a chosen boundary cycle in O(n log n) time, a tight octagonal decomposition in O(gnlog n) time, and a shortest contractible cycle enclosing a nonempty set of faces in O(nlog2 n) time.
更多查看译文
关键词
shortest cycle,nlog2 n,n log n,shortest contractible cycle,tight cycle,orientable combinatorial surface,chosen boundary cycle,simple cycle,nonseparating cycle,topological graph theory,combinatorial surface,gnlog n,noncontractible cycle,graph theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络