通过归约到最大流在几乎线性时间内计算规范割层级
Canonical Cut Hierarchy in Almost-Linear Time via Reduction to Max-Flow
Karthekeyan Chandrasekaran, Harshul Sagar
AI 速读 基于摘要
作者提出一种随机化几乎线性时间算法，通过归约到最大流来计算无向图中的规范割层级，并由此得到多个图参数与结构的快速算法。
cs.DS
查看原文摘要
The canonical cut hierarchy recursively partitions a graph along Tutte-Nash-Williams partitions, choosing the partition with the most number of parts at each step. We give a randomized almost linear-time algorithm for computing this hierarchy in undirected graphs with polynomially bounded capacities via reduction to max-flow. This yields randomized almost linear-time algorithms for computing partition connectivity, strength, both arboricity and fractional arboricity, both integral and fractional spanning tree packing numbers, and implicit representations of the principal partition sequence and a maximum fractional spanning tree packing.