FPT algorithm counts minimum (S,T)-edge-cuts of size p in time 2^{O(p^2)} n^{O(1)} via a drainage transformation that isolates at most n successive min-cuts whose edges cover every min-cut.
Fundamenta Mathematicæ 10(1), 96– 115 (1927) Fixed-parameter tractability of counting small minimum ( S, T )-cuts 23
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fixed-parameter tractability of counting small minimum $(S,T)$-cuts
FPT algorithm counts minimum (S,T)-edge-cuts of size p in time 2^{O(p^2)} n^{O(1)} via a drainage transformation that isolates at most n successive min-cuts whose edges cover every min-cut.