一个平面图的最小割的时间复杂度为O(nloglogn)
Min st-Cut of a Planar Graph in O(n loglog n) Time
摘要:
给定一个具有非负边权的平面无向n-顶点图G,我们给出了如何在O(nloglog n)时间和O(n)空间中计算G中给定顶点s和t的最小st-割.时间复杂度为O(n)。
英文摘要:
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).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。