Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

DCG
2010

favoriteEmaildiscussreport

88views more DCG 2010»

Computing the Shortest Essential Cycle

13 years 4 months ago

Computing the Shortest Essential Cycle

Download compgeom.cs.uiuc.edu

An essential cycle on a surface is a simple cycle that cannot be continuously deformed to a point or a single boundary. We describe algorithms to compute the shortest essential cycle in an orientable combinatorial surface in O(n2 log n) time, or in O(nlog n) time when both the genus and number of boundaries are fixed. Our results correct an error in a paper of Erickson and Har-Peled [DCG 2004].

Jeff Erickson, Pratik Worah

Real-time Traffic

DCG 2010 | Essential Cycle | Orientable Combinatorial Surface | Shortest Essential Cycle |

claim paper

Related Content

» Tightening Nonsimple Paths and Cycles on Surfaces

» Computing the Girth of a Planar Graph

» Finding shortest nontrivial cycles in directed graphs on surfaces

» Minimum cuts and shortest homologous cycles

» Algorithms for the edgewidth of an embedded graph

» Finding Shortest Nonseparating and Noncontractible Cycles for Topologically Embedded Graph...

» Lattices with Many Cycles Are Dense

» Outputsensitive algorithm for the edgewidth of an embedded graph

» The FloydWarshall algorithm on graphs with negative cycles

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DCG
Authors	Jeff Erickson, Pratik Worah

Comments (0)