Answers are grounded in this paper and cite their sources.
We present a min-max formula for the problem of augmenting the node-connectivity of a graph by one and give a polynomial time algorithm for finding an optimal solution. We also solve the minimum-cost version for node-induced cost functions.
No takes yet. Share an insight, caveat, or question.
László A. Végh (2011) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: