- The paper introduces a fixed-parameter tractable algorithm for computing k d-diverse minimum s-t cuts with an explicit runtime of (kd)^(O(k^8d^8))·n^(O(1)).
- It leverages preprocessing techniques, including edge contractions and strongly connected component reductions, to bound minimum cuts by (kd)^2 edges and reduce the search space.
- The method employs advanced color coding and flow augmentation to efficiently enumerate and verify candidate cut profiles while ensuring strict diversity constraints.
Fixed-Parameter Algorithms for Diverse Minimum s--t Cuts
Problem Setting and Complexity Landscape
The paper "An FPT Algorithm for Diverse Minimum s-t Cuts" (2607.03266) addresses the problem of computing k minimum s--t cuts in a directed, capacitated graph, such that any pair of cuts differs by at least d edges (diversity measured as the size of the symmetric difference). When d is small ($1$ or $2$), this reduces to enumerating all minimum cuts, a #P-complete task. With arbitrary d and t0, the associated decision problem is also known to be NP-complete.
Prior work gave polynomial-time algorithms for computing families of minimum t1--t2 cuts maximizing sum or coverage diversity, but it was shown that maximizing the minimum pairwise diversity (the "min-diverse" variant) is already hard for t3 ("Finding Diverse Minimum s-t Cuts" [de Berg et al., ISAAC 2023]). The theoretical question addressed is whether the problem admits fixed-parameter tractable (FPT) algorithms when parameterized by t4 and t5.
Main Algorithmic Contributions
The central contribution is an explicit FPT algorithm running in t6 time for the Min-t7-Diverse Minimum t8--t9-Cuts problem, parameterized by k0. The algorithm is constructive: given a positive instance, it outputs the desired family of k1 minimum cuts with specified diversity.
The solution framework proceeds in two phases:
- Preprocessing and Instance Reduction: The input graph is processed using a series of contractions and structural reductions, limiting attention to the set of critical edges (i.e., edges belonging to some minimum k2--k3 cut). Through a combination of edge contractions along residual paths (guided by max-flow computations), strongly connected component contractions, and analysis of cut structure, the instance is reduced to one where each minimum cut is bounded in size by k4 edges. If a minimum cut exceeding this size exists, the paper proves that a k5-diverse set of k6 minimum cuts can be constructed in polynomial time.
- Color Coding and Flow Augmentation: For the bounded-cut instance, the algorithm employs an extension of color coding (Alon-Yuster-Zwick), partitioning critical edges into regions according to membership vectors over the k7 cuts. All relevant "profiles" (collections encoding how many edges of each color/multiplicity are used in each region) and associated colorings (at most k8, k9) are enumerated. For each candidate profile, it checks feasibility using flow augmentation—applying the deterministic flow-augmentation technique of Kim et al. ("Flow-augmentation I", JACM 2025)—which allows the problem to be reduced to a sequence of constrained minimum cut computations in auxiliary graphs, each step preserving the specified diversity constraints.
Structural Properties and Algorithmic Primitives
An analytical highlight is the exploitation of strong combinatorial structure. After preprocessing, the set of remaining minimum cuts in the contracted graph have a total order induced by a topological sort on a DAG (derived from reversing residual edges). Each minimum cut corresponds to splitting the ordered vertex list at some position, and crucially, for sufficiently large cut size, there exists a sequence of such cuts which are pairwise s0-diverse.
The coloring and flow augmentation scheme leverages this structure to reduce the search space of possible cut families, enabling enumeration and verification in terms of profiles, active regions, and bounded guesses (with the total number of such configurations a function only of s1 and s2).
Numerical Bounds and Claims
- FPT runtime: s3 for general capacitated, directed graphs.
- Bounded-size cut instance: The instance reduction ensures all relevant minimum cuts have at most s4 edges.
- Profile space: Number of profiles and region colorings is s5, with s6.
Implications and Theoretical Outlook
The result positions the Min-s7-Diverse Minimum s8--s9-Cuts problem in the FPT class with respect to t0, sharply separating its complexity from both the classical minimum cut problem (P) and the associated counting and enumeration problems (#P/NPC). This provides the first such FPT result for the min-diverse cut variant in directed graphs. The multiplicity-based diversity framework and flow augmentation technique demonstrate the utility of structural and algebraic graph reductions in parameterized algorithms for cut families with global combinatorial constraints.
The work also lays out directions for future research, notably:
- Improvements to the exponent in the parameter dependence (single-exponential FPT in t1 remains open).
- Specialized faster algorithms for undirected graphs leveraging the easier contraction properties.
- Kernelization (existence of polynomial kernels in the parameters t2 and t3).
- Hardness of the problem for other diversity variants (e.g., diversity measured by intersection size), and dual parameterizations.
Conclusion
This paper establishes the fixed-parameter tractability of finding t4 t5-diverse minimum t6--t7 cuts in capacitated, directed graphs via a combination of deep structural insights, advanced color coding, and flow-augmentation. It advances the theoretical foundations of diverse combinatorial optimization, showing that diversity constraints—while typically inducing combinatorial explosion—can be tamed by parameterization and precise structural decompositions. These results should provide a blueprint for handling diversity constraints in other network and cut problems and inform the development of FPT and kernelization techniques for structurally similar settings.