2000 character limit reached
Min st-Cut of a Planar Graph in O(n loglog n) Time
Published 21 Jul 2010 in cs.DM | (1007.3609v2)
Abstract: Given a planar undirected n-vertex graph G with non-negative edge weights, we show how to compute, for given vertices s and t in G, a min st-cut in G in O(n loglog n) time and O(n) space. The previous best time bound was O(n log n).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.