Fixed-parameter tractability of counting small minimum \((S,T)\)-cuts

DOI10.1007/978-3-030-30786-8_7OpenAlexW2972819067MaRDI QIDQ2301536

Arpad Rimmel, Joanna Tomasik, Benjamin Mouscadet, Pierre Bergé

Publication date: 24 February 2020

Full work available at URL: https://arxiv.org/abs/1907.02353

zbMATH Keywords

fixed-parameter tractabilitycounting problemsminimum cuts

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts