Solving \((k-1)\)-stable instances of \(k\)-Terminal Cut with isolating cuts

DOI10.1007/978-3-030-36412-0_39zbMath1443.90326arXiv1806.06091OpenAlexW2996735613MaRDI QIDQ2180178

Mark Velednitsky

Publication date: 13 May 2020

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

zbMATH Keywords

isolating, cut, stability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem

This page was built for publication: Solving \((k-1)\)-stable instances of \(k\)-Terminal Cut with isolating cuts