Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.14906

Three-Terminal Reachability-Preserving Minimum Node Cut: Planar Hardness and a General-Graph \(O(\sqrt n)\)-Approximation

Qi Duan
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the three-terminal reachability-preserving minimum node cut problem (\RPMNC). The input is an undirected graph \(G=(V,E)\), nonnegative vertex weights on nonterminal vertices, two protected terminals \(s_1,s_2\), and a target terminal \(t\). The goal is to delete a minimum-weight set of nonterminal vertices so that \(t\) is disconnected from the protected terminals, while \(s_1\) and \(s_2\) remain connected. This problem captures a basic ``separate while preserve'' requirement that arises in biological intervention design, image analysis with connectivity constraints, and cyber-security attack graph mitigation, where deleting or blocking a node represents preventing the corresponding action, state, or biological entity from participating in a harmful pathway. We prove two results. First, the weighted planar version of three-terminal \RPMNC{} is NP-complete. The reduction is from \textsc{Independent Set} on 3-regular Hamiltonian planar graphs and uses a one-sided blocker construction. Second, we give a polynomial-time \(O(\sqrt n)\)-approximation algorithm for general graphs. The algorithm is based on an exact path--separator identity, a directed split-graph representation of rooted vertex separators, and a root-linear approximation of a monotone submodular separator function.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Qi Duan. 2026-06-12. Three-Terminal Reachability-Preserving Minimum Node Cut: Planar Hardness and a General-Graph \(O(\sqrt n)\)-Approximation. https://arxiv.org/abs/2606.14906

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗