Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
CoRR(2024)
摘要
We present a deterministic fully dynamic algorithm with subpolynomial
worst-case time per graph update such that after processing each update of the
graph, the algorithm outputs a minimum cut of the graph if the graph has a cut
of size at most c for some c = (log n)^o(1). Previously, the best update
time was O(√(n)) for any c > 2 and c = O(log n) [Thorup,
Combinatorica'07].
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要