Answers are grounded in this paper and cite their sources.
An algorithm is developed for finding the minimum number of vertices ω s,t whose removal from a directed graph G breaks all directed paths from a given vertex s to a given vertex t. The algorithm is performed on G without any modification of its structure and entails examining each vertex at most r times with 2ω s,t ≥ r and, in practice, almost always with ω s,t ≥ r.
No takes yet. Share an insight, caveat, or question.
I. Frisch (1967) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: