Login / Signup

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

Pierre BergéWassim BouazizArpad RimmelJoanna Tomasik
Published in: SIAM J. Discret. Math. (2023)
Keyphrases
  • small sized
  • parameterized complexity
  • fixed parameter tractable
  • minimum cost
  • global constraints
  • information extraction
  • symmetry breaking